Base | Representation |
---|---|
bin | 11001011111010001010111… |
… | …001111001010111001001001 |
3 | 112200220122222102001120121221 |
4 | 121133101113033022321021 |
5 | 104143122011131121134 |
6 | 1034230025110002041 |
7 | 32416652141250625 |
oct | 3137212717127111 |
9 | 480818872046557 |
10 | 112100110020169 |
11 | 3279a431731937 |
12 | 106a5904046321 |
13 | 4a71cc208684b |
14 | 1d979622d0185 |
15 | ce5eab40d5b4 |
hex | 65f4573cae49 |
112100110020169 has 2 divisors, whose sum is σ = 112100110020170. Its totient is φ = 112100110020168.
The previous prime is 112100110020167. The next prime is 112100110020179. The reversal of 112100110020169 is 961020011001211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102183531136569 + 9916578883600 = 10108587^2 + 3149060^2 .
It is a cyclic number.
It is not a de Polignac number, because 112100110020169 - 21 = 112100110020167 is a prime.
It is a super-2 number, since 2×1121001100201692 (a number of 29 digits) contains 22 as substring.
Together with 112100110020167, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (112100110020163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050055010084 + 56050055010085.
It is an arithmetic number, because the mean of its divisors is an integer number (56050055010085).
Almost surely, 2112100110020169 is an apocalyptic number.
It is an amenable number.
112100110020169 is a deficient number, since it is larger than the sum of its proper divisors (1).
112100110020169 is an equidigital number, since it uses as much as digits as its factorization.
112100110020169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 25.
The spelling of 112100110020169 in words is "one hundred twelve trillion, one hundred billion, one hundred ten million, twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •