Base | Representation |
---|---|
bin | 11110100101101111100… |
… | …101110110001100001100 |
3 | 21102221220202002021011211 |
4 | 132211233211312030030 |
5 | 233420110431400022 |
6 | 4245410242224204 |
7 | 304605163245445 |
oct | 36455745661414 |
9 | 7387822067154 |
10 | 2102111200012 |
11 | 740555a7478a |
12 | 29b4a0955064 |
13 | 1232c7583795 |
14 | 73a580742cc |
15 | 39a32742e77 |
hex | 1e96f97630c |
2102111200012 has 24 divisors (see below), whose sum is σ = 3724006761216. Its totient is φ = 1038116006928.
The previous prime is 2102111199989. The next prime is 2102111200019. The reversal of 2102111200012 is 2100021112012.
It is a junction number, because it is equal to n+sod(n) for n = 2102111199965 and 2102111200001.
It is not an unprimeable number, because it can be changed into a prime (2102111200019) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 410233 + ... + 2091055.
It is an arithmetic number, because the mean of its divisors is an integer number (155166948384).
Almost surely, 22102111200012 is an apocalyptic number.
It is an amenable number.
2102111200012 is a deficient number, since it is larger than the sum of its proper divisors (1621895561204).
2102111200012 is a wasteful number, since it uses less digits than its factorization.
2102111200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684677 (or 1684675 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2102111200012 its reverse (2100021112012), we get a palindrome (4202132312024).
It can be divided in two parts, 21021112000 and 12, that added together give a palindrome (21021112012).
The spelling of 2102111200012 in words is "two trillion, one hundred two billion, one hundred eleven million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •