Base | Representation |
---|---|
bin | 11101011001010001101… |
… | …00010100111000010100 |
3 | 10120112222210011202222210 |
4 | 32230220310110320110 |
5 | 113021441020321322 |
6 | 2051553310353420 |
7 | 132653536241241 |
oct | 16545064247024 |
9 | 3515883152883 |
10 | 1010002120212 |
11 | 35a380958948 |
12 | 1438b37bb870 |
13 | 74320549077 |
14 | 36c5499c5c8 |
15 | 1b4148e270c |
hex | eb28d14e14 |
1010002120212 has 24 divisors (see below), whose sum is σ = 2357021612736. Its totient is φ = 336617373568.
The previous prime is 1010002120201. The next prime is 1010002120223. The reversal of 1010002120212 is 2120212000101.
It is an interprime number because it is at equal distance from previous prime (1010002120201) and next prime (1010002120223).
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 6165768 + ... + 6327455.
It is an arithmetic number, because the mean of its divisors is an integer number (98209233864).
Almost surely, 21010002120212 is an apocalyptic number.
1010002120212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010002120212 is an abundant number, since it is smaller than the sum of its proper divisors (1347019492524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010002120212 is a wasteful number, since it uses less digits than its factorization.
1010002120212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12499967 (or 12499965 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1010002120212 its reverse (2120212000101), we get a palindrome (3130214120313).
The spelling of 1010002120212 in words is "one trillion, ten billion, two million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •