Base | Representation |
---|---|
bin | 1001001001100110101100… |
… | …10010100010110110001011 |
3 | 2122020120101120001011000212 |
4 | 10210303112102202312023 |
5 | 10114131230313000021 |
6 | 110443321202151335 |
7 | 4144465432021346 |
oct | 444632622426613 |
9 | 78216346034025 |
10 | 20121222000011 |
11 | 64583a9294920 |
12 | 230b76465254b |
13 | b2c5666c6122 |
14 | 4d7c2d9bd45d |
15 | 24d5ec27085b |
hex | 124cd64a2d8b |
20121222000011 has 4 divisors (see below), whose sum is σ = 21950424000024. Its totient is φ = 18292020000000.
The previous prime is 20121221999993. The next prime is 20121222000037. The reversal of 20121222000011 is 11000022212102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20121222000011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20121222000011.
It is not an unprimeable number, because it can be changed into a prime (20121222000071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 914600999990 + ... + 914601000011.
It is an arithmetic number, because the mean of its divisors is an integer number (5487606000006).
Almost surely, 220121222000011 is an apocalyptic number.
20121222000011 is a deficient number, since it is larger than the sum of its proper divisors (1829202000013).
20121222000011 is a wasteful number, since it uses less digits than its factorization.
20121222000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1829202000012.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20121222000011 its reverse (11000022212102), we get a palindrome (31121244212113).
The spelling of 20121222000011 in words is "twenty trillion, one hundred twenty-one billion, two hundred twenty-two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •