Base | Representation |
---|---|
bin | 11101010010000001101… |
… | …010100001010101111100 |
3 | 21010100220002010100111220 |
4 | 131102001222201111330 |
5 | 230432011321231022 |
6 | 4140222352113340 |
7 | 265243455441441 |
oct | 35220152412574 |
9 | 7110802110456 |
10 | 2012220102012 |
11 | 70641787534a |
12 | 285b94535850 |
13 | 1179a01a0b73 |
14 | 6d56b8039c8 |
15 | 37520c2885c |
hex | 1d481aa157c |
2012220102012 has 24 divisors (see below), whose sum is σ = 4695306054096. Its totient is φ = 670722060288.
The previous prime is 2012220101999. The next prime is 2012220102019. The reversal of 2012220102012 is 2102010222102.
It is a junction number, because it is equal to n+sod(n) for n = 2012220101982 and 2012220102000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012220102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1776303 + ... + 2679494.
It is an arithmetic number, because the mean of its divisors is an integer number (195637752254).
Almost surely, 22012220102012 is an apocalyptic number.
It is an amenable number.
2012220102012 is an abundant number, since it is smaller than the sum of its proper divisors (2683085952084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012220102012 is a wasteful number, since it uses less digits than its factorization.
2012220102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4493437 (or 4493435 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2012220102012 its reverse (2102010222102), we get a palindrome (4114230324114).
The spelling of 2012220102012 in words is "two trillion, twelve billion, two hundred twenty million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •