Base | Representation |
---|---|
bin | 1001001001100100011100… |
… | …01111011000101000110011 |
3 | 2122020110021022111100220100 |
4 | 10210302032033120220303 |
5 | 10114121241340242321 |
6 | 110443001221443443 |
7 | 4144423453342563 |
oct | 444621617305063 |
9 | 78213238440810 |
10 | 20120013212211 |
11 | 6457938a26740 |
12 | 230b487870583 |
13 | b2c403145a83 |
14 | 4d7b57242da3 |
15 | 24d57b09b326 |
hex | 124c8e3d8a33 |
20120013212211 has 12 divisors (see below), whose sum is σ = 31704263243640. Its totient is φ = 12193947401280.
The previous prime is 20120013212209. The next prime is 20120013212231. The reversal of 20120013212211 is 11221231002102.
20120013212211 is a `hidden beast` number, since 2 + 0 + 120 + 0 + 1 + 321 + 221 + 1 = 666.
It is not a de Polignac number, because 20120013212211 - 21 = 20120013212209 is a prime.
It is a super-4 number, since 4×201200132122114 (a number of 54 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (20120013212231) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 101616228246 + ... + 101616228443.
It is an arithmetic number, because the mean of its divisors is an integer number (2642021936970).
Almost surely, 220120013212211 is an apocalyptic number.
20120013212211 is a deficient number, since it is larger than the sum of its proper divisors (11584250031429).
20120013212211 is a wasteful number, since it uses less digits than its factorization.
20120013212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203232456706 (or 203232456703 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 20120013212211 its reverse (11221231002102), we get a palindrome (31341244214313).
The spelling of 20120013212211 in words is "twenty trillion, one hundred twenty billion, thirteen million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •