Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …0110110010100101010000 |
3 | 1022202122222202222112201221 |
4 | 2102333133012302211100 |
5 | 2310444240032241422 |
6 | 33252233220334424 |
7 | 2061534300426406 |
oct | 222773706624520 |
9 | 38678882875657 |
10 | 10101211212112 |
11 | 3244999433769 |
12 | 1171823244414 |
13 | 583703886907 |
14 | 26cc88d9b476 |
15 | 127b506803c7 |
hex | 92fdf1b2950 |
10101211212112 has 20 divisors (see below), whose sum is σ = 19679224335316. Its totient is φ = 5022701706240.
The previous prime is 10101211212109. The next prime is 10101211212227. The reversal of 10101211212112 is 21121211210101.
It can be written as a sum of positive squares in 2 ways, for example, as 163736766736 + 9937474445376 = 404644^2 + 3152376^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1743990753 + ... + 1743996544.
Almost surely, 210101211212112 is an apocalyptic number.
It is an amenable number.
10101211212112 is a deficient number, since it is larger than the sum of its proper divisors (9578013123204).
10101211212112 is a wasteful number, since it uses less digits than its factorization.
10101211212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3487987486 (or 3487987480 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10101211212112 its reverse (21121211210101), we get a palindrome (31222422422213).
It can be divided in two parts, 10101 and 211212112, that multiplied together give a palindrome (2133453543312).
The spelling of 10101211212112 in words is "ten trillion, one hundred one billion, two hundred eleven million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •