Base | Representation |
---|---|
bin | 1010000011100011000000… |
… | …11101111110010110100111 |
3 | 2220021220012222021000220112 |
4 | 11001301200131332112213 |
5 | 10344241100142010434 |
6 | 115010055123523235 |
7 | 4441355462522651 |
oct | 501614035762647 |
9 | 86256188230815 |
10 | 22112110110119 |
11 | 7055769771997 |
12 | 2591584b2951b |
13 | c45217262873 |
14 | 56633624d6d1 |
15 | 2852c031ddce |
hex | 141c6077e5a7 |
22112110110119 has 2 divisors, whose sum is σ = 22112110110120. Its totient is φ = 22112110110118.
The previous prime is 22112110110091. The next prime is 22112110110137. The reversal of 22112110110119 is 91101101121122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22112110110119 - 232 = 22107815142823 is a prime.
It is a super-2 number, since 2×221121101101192 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 22112110110094 and 22112110110103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22112110112119) 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, 11056055055059 + 11056055055060.
It is an arithmetic number, because the mean of its divisors is an integer number (11056055055060).
Almost surely, 222112110110119 is an apocalyptic number.
22112110110119 is a deficient number, since it is larger than the sum of its proper divisors (1).
22112110110119 is an equidigital number, since it uses as much as digits as its factorization.
22112110110119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 22112110110119 in words is "twenty-two trillion, one hundred twelve billion, one hundred ten million, one hundred ten thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •