Base | Representation |
---|---|
bin | 110010000001100110010101… |
… | …001001010111111010001011 |
3 | 1001211222221221122022101111111 |
4 | 302001212111021113322023 |
5 | 212314134442203000021 |
6 | 2055532113230511151 |
7 | 64225233315540451 |
oct | 6201462511277213 |
9 | 1054887848271444 |
10 | 220012202000011 |
11 | 64114718360613 |
12 | 20813a093654b7 |
13 | 959c0a5511b65 |
14 | 3c4890c6429d1 |
15 | 1a680502978e1 |
hex | c81995257e8b |
220012202000011 has 2 divisors, whose sum is σ = 220012202000012. Its totient is φ = 220012202000010.
The previous prime is 220012201999957. The next prime is 220012202000033. The reversal of 220012202000011 is 110000202210022.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220012202000011 - 217 = 220012201868939 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220012201999955 and 220012202000000.
It is not a weakly prime, because it can be changed into another prime (220012202040011) 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 as a sum of consecutive naturals, namely, 110006101000005 + 110006101000006.
It is an arithmetic number, because the mean of its divisors is an integer number (110006101000006).
Almost surely, 2220012202000011 is an apocalyptic number.
220012202000011 is a deficient number, since it is larger than the sum of its proper divisors (1).
220012202000011 is an equidigital number, since it uses as much as digits as its factorization.
220012202000011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220012202000011 its reverse (110000202210022), we get a palindrome (330012404210033).
The spelling of 220012202000011 in words is "two hundred twenty trillion, twelve billion, two hundred two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •