Base | Representation |
---|---|
bin | 11001000010001010110100… |
… | …100001000001001101000011 |
3 | 112102211110220122120110201111 |
4 | 121002022310201001031003 |
5 | 103412340222334021402 |
6 | 1030055202022544151 |
7 | 32122323044366536 |
oct | 3102126441011503 |
9 | 472743818513644 |
10 | 110100220220227 |
11 | 32099272009a86 |
12 | 104221b0b98057 |
13 | 49585385c7913 |
14 | 1d28c44328a1d |
15 | cade5ce4c9d7 |
hex | 6422b4841343 |
110100220220227 has 2 divisors, whose sum is σ = 110100220220228. Its totient is φ = 110100220220226.
The previous prime is 110100220220153. The next prime is 110100220220251. The reversal of 110100220220227 is 722022022001011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110100220220227 - 27 = 110100220220099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100220220198 and 110100220220207.
It is not a weakly prime, because it can be changed into another prime (110100220224227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050110110113 + 55050110110114.
It is an arithmetic number, because the mean of its divisors is an integer number (55050110110114).
Almost surely, 2110100220220227 is an apocalyptic number.
110100220220227 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100220220227 is an equidigital number, since it uses as much as digits as its factorization.
110100220220227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 110100220220227 its reverse (722022022001011), we get a palindrome (832122242221238).
The spelling of 110100220220227 in words is "one hundred ten trillion, one hundred billion, two hundred twenty million, two hundred twenty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •