Base | Representation |
---|---|
bin | 1001100110001001101111… |
… | …11001110000000001000100 |
3 | 2202201100020111000201011222 |
4 | 10303010313321300001010 |
5 | 10231214111211223022 |
6 | 112514102043415512 |
7 | 4305402004162010 |
oct | 463046771600104 |
9 | 82640214021158 |
10 | 21102112211012 |
11 | 67a63a0237468 |
12 | 2449892824598 |
13 | ba0bc7863bc1 |
14 | 52d4c206d540 |
15 | 268daaeb2242 |
hex | 133137e70044 |
21102112211012 has 12 divisors (see below), whose sum is σ = 42204224422080. Its totient is φ = 9043762376136.
The previous prime is 21102112210987. The next prime is 21102112211023. The reversal of 21102112211012 is 21011221120112.
21102112211012 is an admirable number.
It is a super-2 number, since 2×211021122110122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 376823432312 + ... + 376823432367.
It is an arithmetic number, because the mean of its divisors is an integer number (3517018701840).
Almost surely, 221102112211012 is an apocalyptic number.
It is an amenable number.
21102112211012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21102112211012 is a wasteful number, since it uses less digits than its factorization.
21102112211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753646864690 (or 753646864688 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21102112211012 its reverse (21011221120112), we get a palindrome (42113333331124).
The spelling of 21102112211012 in words is "twenty-one trillion, one hundred two billion, one hundred twelve million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •