Base | Representation |
---|---|
bin | 110010000100100000100101… |
… | …111101001100101000001011 |
3 | 1001212201002011211211110111211 |
4 | 302010200211331030220023 |
5 | 212330424041200000021 |
6 | 2100204031010033551 |
7 | 64245543413514532 |
oct | 6204404575145013 |
9 | 1055632154743454 |
10 | 220212200000011 |
11 | 64191518a8611a |
12 | 208467242788b7 |
13 | 95b4bc92b08ab |
14 | 3c54482363319 |
15 | 1a6d3584743e1 |
hex | c84825f4ca0b |
220212200000011 has 2 divisors, whose sum is σ = 220212200000012. Its totient is φ = 220212200000010.
The previous prime is 220212199999903. The next prime is 220212200000017. The reversal of 220212200000011 is 110000002212022.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220212200000011 - 217 = 220212199868939 is a prime.
It is a super-4 number, since 4×2202122000000114 (a number of 58 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220212199999937 and 220212200000000.
It is not a weakly prime, because it can be changed into another prime (220212200000017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110106100000005 + 110106100000006.
It is an arithmetic number, because the mean of its divisors is an integer number (110106100000006).
Almost surely, 2220212200000011 is an apocalyptic number.
220212200000011 is a deficient number, since it is larger than the sum of its proper divisors (1).
220212200000011 is an equidigital number, since it uses as much as digits as its factorization.
220212200000011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220212200000011 its reverse (110000002212022), we get a palindrome (330212202212033).
The spelling of 220212200000011 in words is "two hundred twenty trillion, two hundred twelve billion, two hundred million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •