Base | Representation |
---|---|
bin | 11101010000000100100… |
… | …011011101111110011100 |
3 | 21010011110210111001201112 |
4 | 131100010203131332130 |
5 | 230413212000214322 |
6 | 4135234211201152 |
7 | 265140450305540 |
oct | 35200443357634 |
9 | 7104423431645 |
10 | 2010121101212 |
11 | 70553aa59a44 |
12 | 2856a95a61b8 |
13 | 117727372a63 |
14 | 6d40cb37a20 |
15 | 3744b80c5e2 |
hex | 1d4048ddf9c |
2010121101212 has 96 divisors (see below), whose sum is σ = 4183302122496. Its totient is φ = 827302694400.
The previous prime is 2010121101187. The next prime is 2010121101229. The reversal of 2010121101212 is 2121011210102.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19233137 + ... + 19337367.
It is an arithmetic number, because the mean of its divisors is an integer number (43576063776).
Almost surely, 22010121101212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2010121101212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2091651061248).
2010121101212 is an abundant number, since it is smaller than the sum of its proper divisors (2173181021284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010121101212 is a wasteful number, since it uses less digits than its factorization.
2010121101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104547 (or 104545 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2010121101212 its reverse (2121011210102), we get a palindrome (4131132311314).
The spelling of 2010121101212 in words is "two trillion, ten billion, one hundred twenty-one million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •