Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …001100011101111001110011 |
3 | 111010002221212121211211100002 |
4 | 112233112200030131321303 |
5 | 101102040012241011011 |
6 | 552412230350420215 |
7 | 30031361561060516 |
oct | 2657264014357163 |
9 | 433087777754302 |
10 | 100011001110131 |
11 | 29959477933031 |
12 | b272975b0166b |
13 | 43a5cc636b977 |
14 | 1a9a7b5cd0d7d |
15 | b867b04ccc3b |
hex | 5af5a031de73 |
100011001110131 has 2 divisors, whose sum is σ = 100011001110132. Its totient is φ = 100011001110130.
The previous prime is 100011001110077. The next prime is 100011001110233. The reversal of 100011001110131 is 131011100110001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100011001110131 - 214 = 100011001093747 is a prime.
It is a super-2 number, since 2×1000110011101312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (100011001110731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005500555065 + 50005500555066.
It is an arithmetic number, because the mean of its divisors is an integer number (50005500555066).
Almost surely, 2100011001110131 is an apocalyptic number.
100011001110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011001110131 is an equidigital number, since it uses as much as digits as its factorization.
100011001110131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 100011001110131 its reverse (131011100110001), we get a palindrome (231022101220132).
The spelling of 100011001110131 in words is "one hundred trillion, eleven billion, one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •