Base | Representation |
---|---|
bin | 101101111110011011011001… |
… | …100010010001001000001100 |
3 | 222111221100000101220202022212 |
4 | 231332123121202101020030 |
5 | 203000334420210000022 |
6 | 1554014212131325552 |
7 | 60406423013422616 |
oct | 5576333142211014 |
9 | 874840011822285 |
10 | 202202120000012 |
11 | 5947848a383760 |
12 | 1a818160a508b8 |
13 | 88a97691136a2 |
14 | 37d08c5d69db6 |
15 | 1859b1b6a93e2 |
hex | b7e6d989120c |
202202120000012 has 48 divisors (see below), whose sum is σ = 388085491906560. Its totient is φ = 91418906174400.
The previous prime is 202202120000011. The next prime is 202202120000021. The reversal of 202202120000012 is 210000021202202.
It is not an unprimeable number, because it can be changed into a prime (202202120000011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76239914 + ... + 78847502.
It is an arithmetic number, because the mean of its divisors is an integer number (8085114414720).
Almost surely, 2202202120000012 is an apocalyptic number.
202202120000012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
202202120000012 is a deficient number, since it is larger than the sum of its proper divisors (185883371906548).
202202120000012 is a wasteful number, since it uses less digits than its factorization.
202202120000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2617022 (or 2617020 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 202202120000012 its reverse (210000021202202), we get a palindrome (412202141202214).
The spelling of 202202120000012 in words is "two hundred two trillion, two hundred two billion, one hundred twenty million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •