Base | Representation |
---|---|
bin | 110010000001100101010100… |
… | …000100011111101010111111 |
3 | 1001211222212010112220022020212 |
4 | 302001211110010133222333 |
5 | 212314130223202431142 |
6 | 2055531413025503035 |
7 | 64225164260445143 |
oct | 6201452404375277 |
9 | 1054885115808225 |
10 | 220011110202047 |
11 | 6411420803864a |
12 | 208137637a1a7b |
13 | 959bc60273568 |
14 | 3c4884763b223 |
15 | 1a67ed94d1d82 |
hex | c8195411fabf |
220011110202047 has 2 divisors, whose sum is σ = 220011110202048. Its totient is φ = 220011110202046.
The previous prime is 220011110202017. The next prime is 220011110202067. The reversal of 220011110202047 is 740202011110022.
220011110202047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220011110202047 - 26 = 220011110201983 is a prime.
It is a super-2 number, since 2×2200111102020472 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220011110202017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110005555101023 + 110005555101024.
It is an arithmetic number, because the mean of its divisors is an integer number (110005555101024).
Almost surely, 2220011110202047 is an apocalyptic number.
220011110202047 is a deficient number, since it is larger than the sum of its proper divisors (1).
220011110202047 is an equidigital number, since it uses as much as digits as its factorization.
220011110202047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 220011110202047 its reverse (740202011110022), we get a palindrome (960213121312069).
The spelling of 220011110202047 in words is "two hundred twenty trillion, eleven billion, one hundred ten million, two hundred two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •