Base | Representation |
---|---|
bin | 11110101111000011101… |
… | …100010101000101111101 |
3 | 21110220201201120122112211 |
4 | 132233003230111011331 |
5 | 234101101200321224 |
6 | 4254142500500421 |
7 | 305411051542231 |
oct | 36570354250575 |
9 | 7426651518484 |
10 | 2112112120189 |
11 | 744818258075 |
12 | 2a14120aa711 |
13 | 12422c503a26 |
14 | 743263965c1 |
15 | 39e1a733894 |
hex | 1ebc3b1517d |
2112112120189 has 2 divisors, whose sum is σ = 2112112120190. Its totient is φ = 2112112120188.
The previous prime is 2112112120051. The next prime is 2112112120229. The reversal of 2112112120189 is 9810212112112.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1759026596089 + 353085524100 = 1326283^2 + 594210^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112112120189 - 219 = 2112111595901 is a prime.
It is a super-2 number, since 2×21121121201892 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2112112120189.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2112112123189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056056060094 + 1056056060095.
It is an arithmetic number, because the mean of its divisors is an integer number (1056056060095).
Almost surely, 22112112120189 is an apocalyptic number.
It is an amenable number.
2112112120189 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112112120189 is an equidigital number, since it uses as much as digits as its factorization.
2112112120189 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 31.
The spelling of 2112112120189 in words is "two trillion, one hundred twelve billion, one hundred twelve million, one hundred twenty thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •