Base | Representation |
---|---|
bin | 10110110000110010110100… |
… | …001001011100101110110111 |
3 | 111010110102201101201210000111 |
4 | 112300302310021130232313 |
5 | 101110201011222023111 |
6 | 552525542042523451 |
7 | 30041501046505522 |
oct | 2660626411345667 |
9 | 433412641653014 |
10 | 100110120111031 |
11 | 29997510a344a8 |
12 | b28a018806587 |
13 | 43b24614a8464 |
14 | 1aa14d9d3dbb9 |
15 | b891621e0a21 |
hex | 5b0cb425cbb7 |
100110120111031 has 2 divisors, whose sum is σ = 100110120111032. Its totient is φ = 100110120111030.
The previous prime is 100110120110999. The next prime is 100110120111109. The reversal of 100110120111031 is 130111021011001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100110120111031 - 25 = 100110120110999 is a prime.
It is a super-2 number, since 2×1001101201110312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110120118031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055060055515 + 50055060055516.
It is an arithmetic number, because the mean of its divisors is an integer number (50055060055516).
Almost surely, 2100110120111031 is an apocalyptic number.
100110120111031 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110120111031 is an equidigital number, since it uses as much as digits as its factorization.
100110120111031 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 13.
Adding to 100110120111031 its reverse (130111021011001), we get a palindrome (230221141122032).
The spelling of 100110120111031 in words is "one hundred trillion, one hundred ten billion, one hundred twenty million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •