Base | Representation |
---|---|
bin | 11001010001000000100100… |
… | …110101111110001010001111 |
3 | 112120102222011200201222220002 |
4 | 121101000210311332022033 |
5 | 104031042241033311002 |
6 | 1032155455004114515 |
7 | 32256104325522131 |
oct | 3121004465761217 |
9 | 476388150658802 |
10 | 111120012010127 |
11 | 3245180698362a |
12 | 10567977235a3b |
13 | 4a0075909ab33 |
14 | 1d62347139051 |
15 | cca747003002 |
hex | 651024d7e28f |
111120012010127 has 2 divisors, whose sum is σ = 111120012010128. Its totient is φ = 111120012010126.
The previous prime is 111120012010097. The next prime is 111120012010141. The reversal of 111120012010127 is 721010210021111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111120012010127 - 238 = 110845134103183 is a prime.
It is a super-2 number, since 2×1111200120101272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111120012010099 and 111120012010108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111120012010327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55560006005063 + 55560006005064.
It is an arithmetic number, because the mean of its divisors is an integer number (55560006005064).
Almost surely, 2111120012010127 is an apocalyptic number.
111120012010127 is a deficient number, since it is larger than the sum of its proper divisors (1).
111120012010127 is an equidigital number, since it uses as much as digits as its factorization.
111120012010127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 111120012010127 its reverse (721010210021111), we get a palindrome (832130222031238).
The spelling of 111120012010127 in words is "one hundred eleven trillion, one hundred twenty billion, twelve million, ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •