Base | Representation |
---|---|
bin | 110010000001011010111111… |
… | …001010011001100100001111 |
3 | 1001211221210111210111210110001 |
4 | 302001122333022121210033 |
5 | 212313440021113311002 |
6 | 2055522340451225131 |
7 | 64224322430410042 |
oct | 6201327712314417 |
9 | 1054853453453401 |
10 | 220000022010127 |
11 | 6410a538043977 |
12 | 2081158a2a81a7 |
13 | 959abb3caac58 |
14 | 3c480b4b70c59 |
15 | 1a67a8ad21a87 |
hex | c816bf29990f |
220000022010127 has 2 divisors, whose sum is σ = 220000022010128. Its totient is φ = 220000022010126.
The previous prime is 220000022010121. The next prime is 220000022010149. The reversal of 220000022010127 is 721010220000022.
220000022010127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220000022010127 is a prime.
It is a super-2 number, since 2×2200000220101272 (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 (220000022010121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110000011005063 + 110000011005064.
It is an arithmetic number, because the mean of its divisors is an integer number (110000011005064).
Almost surely, 2220000022010127 is an apocalyptic number.
220000022010127 is a deficient number, since it is larger than the sum of its proper divisors (1).
220000022010127 is an equidigital number, since it uses as much as digits as its factorization.
220000022010127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 19.
Adding to 220000022010127 its reverse (721010220000022), we get a palindrome (941010242010149).
The spelling of 220000022010127 in words is "two hundred twenty trillion, twenty-two million, ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •