202 (number)
| ||||
|---|---|---|---|---|
| Cardinal | two hundred two | |||
| Ordinal | 202nd (two hundred second) | |||
| Factorization | 2 × 101 | |||
| Divisors | 1, 2, 101, 202 | |||
| Greek numeral | ΣΒ´ | |||
| Roman numeral | CCII | |||
| Binary | 110010102 | |||
| Ternary | 211113 | |||
| Senary | 5346 | |||
| Octal | 3128 | |||
| Duodecimal | 14A12 | |||
| Hexadecimal | CA16 | |||
202 (two hundred [and] two) is the natural number following 201 and preceding 203.
In mathematics[edit]
202 is a Smith number, meaning that its digit sum and the sum of digits of its prime factors are equal.[1] It is also a strobogrammatic number, meaning that when shown on a seven-segment display, turning the display upside-down shows the same number.[2]
There are exactly 202 partitions of 32 (a power of two) into smaller powers of two.[3] There are also 202 distinct (non-congruent) polygons that can be formed by connecting all eight vertices of a regular octagon into a cycle,[4] and 202 distinct (non-isomorphic) directed graphs on four unlabeled vertices, not having any isolated vertices.[5]
See also[edit]
- Area code 202, the area code assigned to Washington D.C.
- HTTP status code 202 meaning the request was accepted but has not yet been fulfilled
- List of highways numbered 202
- The Peugeot 202 automobile
- Potassium sorbate, a preservative whose E number is 202
References[edit]
- ^ Sloane, N. J. A. (ed.). "Sequence A006753 (Smith (or joke) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A018846 (Strobogrammatic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A002577 (Number of partitions of 2^n into powers of 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000940 (Number of n-gons with n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A053598 (Number of n-node unlabeled digraphs without isolated nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.