Base | Representation |
---|---|
bin | 11001001111011010001110… |
… | …110001100110110100001011 |
3 | 112120001110112010201121111112 |
4 | 121033122032301212310023 |
5 | 104022242211221214011 |
6 | 1032033202315120535 |
7 | 32245134155642606 |
oct | 3117321661466413 |
9 | 476043463647445 |
10 | 111010120101131 |
11 | 3240a144850929 |
12 | 1054a60874314b |
13 | 49c32950b8404 |
14 | 1d5acc045133d |
15 | cc796465c58b |
hex | 64f68ec66d0b |
111010120101131 has 2 divisors, whose sum is σ = 111010120101132. Its totient is φ = 111010120101130.
The previous prime is 111010120101047. The next prime is 111010120101211. The reversal of 111010120101131 is 131101021010111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111010120101131 - 222 = 111010115906827 is a prime.
It is a super-2 number, since 2×1110101201011312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111010120101931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505060050565 + 55505060050566.
It is an arithmetic number, because the mean of its divisors is an integer number (55505060050566).
Almost surely, 2111010120101131 is an apocalyptic number.
111010120101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010120101131 is an equidigital number, since it uses as much as digits as its factorization.
111010120101131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 111010120101131 its reverse (131101021010111), we get a palindrome (242111141111242).
The spelling of 111010120101131 in words is "one hundred eleven trillion, ten billion, one hundred twenty million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •