Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …0111001111010010000000 |
3 | 1100011021110211212001201220 |
4 | 2110212312213033102000 |
5 | 2314304041424031422 |
6 | 33415230444555040 |
7 | 2102543601165114 |
oct | 224466647172200 |
9 | 40137424761656 |
10 | 10212201002112 |
11 | 3287a7426373a |
12 | 118b239552a80 |
13 | 591011157675 |
14 | 2743b77d1744 |
15 | 12a9995dde5c |
hex | 949b69cf480 |
10212201002112 has 64 divisors (see below), whose sum is σ = 27140975722560. Its totient is φ = 3402207636480.
The previous prime is 10212201002071. The next prime is 10212201002131. The reversal of 10212201002112 is 21120010221201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 10212201002091 and 10212201002100.
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, 6559123 + ... + 7965330.
It is an arithmetic number, because the mean of its divisors is an integer number (424077745665).
Almost surely, 210212201002112 is an apocalyptic number.
10212201002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10212201002112 is an abundant number, since it is smaller than the sum of its proper divisors (16928774720448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212201002112 is a wasteful number, since it uses less digits than its factorization.
10212201002112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14526301 (or 14526289 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10212201002112 its reverse (21120010221201), we get a palindrome (31332211223313).
The spelling of 10212201002112 in words is "ten trillion, two hundred twelve billion, two hundred one million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.548 sec. • engine limits •