Jump to content

202 (number)

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Certes (talk | contribs) at 23:50, 18 October 2020 (Undid revision 984135338 by 2409:4061:2D80:618C:0:0:4709:1E00 (talk): test edit). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
← 201 202 203 →
Cardinaltwo hundred two
Ordinal202nd
(two hundred second)
Factorization2 × 101
Divisors1, 2, 101, 202
Greek numeralΣΒ´
Roman numeralCCII
Binary110010102
Ternary211113
Senary5346
Octal3128
Duodecimal14A12
HexadecimalCA16

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]

References

[edit]
  1. ^ Sloane, N. J. A. (ed.). "Sequence A006753 (Smith (or joke) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A018846 (Strobogrammatic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ 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.
  4. ^ Sloane, N. J. A. (ed.). "Sequence A000940 (Number of n-gons with n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ 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.