Base | Representation |
---|---|
bin | 110000000001100010100000… |
… | …110101000011110111000110 |
3 | 1000200211200010010112020202021 |
4 | 300001202200311003313012 |
5 | 210140444144030341402 |
6 | 2025113242523233354 |
7 | 62326364335051531 |
oct | 6001424065036706 |
9 | 1020750103466667 |
10 | 211212010012102 |
11 | 613315684032a0 |
12 | 1b83237697885a |
13 | 90b128cc60b28 |
14 | 3a22a04343a18 |
15 | 1964198269d37 |
hex | c018a0d43dc6 |
211212010012102 has 64 divisors (see below), whose sum is σ = 363286890812160. Its totient is φ = 91213260880000.
The previous prime is 211212010012067. The next prime is 211212010012109. The reversal of 211212010012102 is 201210010212112.
It is a super-2 number, since 2×2112120100121022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211212010012109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5346048 + ... + 21236860.
It is an arithmetic number, because the mean of its divisors is an integer number (5676357668940).
Almost surely, 2211212010012102 is an apocalyptic number.
211212010012102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211212010012102 is a deficient number, since it is larger than the sum of its proper divisors (152074880800058).
211212010012102 is a wasteful number, since it uses less digits than its factorization.
211212010012102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15891189.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211212010012102 its reverse (201210010212112), we get a palindrome (412422020224214).
The spelling of 211212010012102 in words is "two hundred eleven trillion, two hundred twelve billion, ten million, twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •