Base | Representation |
---|---|
bin | 1001010001110010011110… |
… | …0100011110011001011000 |
3 | 1100010020002221121022220020 |
4 | 2110130213210132121120 |
5 | 2314114040031413422 |
6 | 33410212143230440 |
7 | 2102004344341011 |
oct | 224344744363130 |
9 | 40106087538806 |
10 | 10201211201112 |
11 | 3283344861578 |
12 | 1189090ba8420 |
13 | 58cc7c391339 |
14 | 273a54018008 |
15 | 12a5548b695c |
hex | 9472791e658 |
10201211201112 has 16 divisors (see below), whose sum is σ = 25503028002840. Its totient is φ = 3400403733696.
The previous prime is 10201211201063. The next prime is 10201211201119. The reversal of 10201211201112 is 21110211210201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10201211201091 and 10201211201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201211201119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212525233333 + ... + 212525233380.
Almost surely, 210201211201112 is an apocalyptic number.
10201211201112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10201211201112 is an abundant number, since it is smaller than the sum of its proper divisors (15301816801728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201211201112 is a wasteful number, since it uses less digits than its factorization.
10201211201112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425050466722 (or 425050466718 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10201211201112 its reverse (21110211210201), we get a palindrome (31311422411313).
The spelling of 10201211201112 in words is "ten trillion, two hundred one billion, two hundred eleven million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •