Base | Representation |
---|---|
bin | 101101111011110010101111… |
… | …001100011010100100011100 |
3 | 222111022000120022012110020120 |
4 | 231323302233030122210130 |
5 | 202434403022334031022 |
6 | 1553355101551314540 |
7 | 60360352141351662 |
oct | 5573625714324434 |
9 | 874260508173216 |
10 | 202021021002012 |
11 | 594086a7751073 |
12 | 1a7a903b21ba50 |
13 | 88956678ac584 |
14 | 37c5c26212c32 |
15 | 185506c766d5c |
hex | b7bcaf31a91c |
202021021002012 has 24 divisors (see below), whose sum is σ = 471383874629136. Its totient is φ = 67340127149568.
The previous prime is 202021021002001. The next prime is 202021021002023. The reversal of 202021021002012 is 210200120120202.
It is an interprime number because it is at equal distance from previous prime (202021021002001) and next prime (202021021002023).
It is a junction number, because it is equal to n+sod(n) for n = 202021021001982 and 202021021002000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22675893 + ... + 30302444.
It is an arithmetic number, because the mean of its divisors is an integer number (19640994776214).
Almost surely, 2202021021002012 is an apocalyptic number.
It is an amenable number.
202021021002012 is an abundant number, since it is smaller than the sum of its proper divisors (269362853627124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202021021002012 is a wasteful number, since it uses less digits than its factorization.
202021021002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53296117 (or 53296115 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202021021002012 its reverse (210200120120202), we get a palindrome (412221141122214).
The spelling of 202021021002012 in words is "two hundred two trillion, twenty-one billion, twenty-one million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •