Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1110000110110110011 |
3 | 100120101211211111221201 |
4 | 1131033001300312303 |
5 | 3120011142011011 |
6 | 113553455032031 |
7 | 10142551616203 |
oct | 1351701606663 |
9 | 316354744851 |
10 | 100110110131 |
11 | 39502602509 |
12 | 1749a80b617 |
13 | 9595582c75 |
14 | 4bb9924403 |
15 | 290dc39cc1 |
hex | 174f070db3 |
100110110131 has 2 divisors, whose sum is σ = 100110110132. Its totient is φ = 100110110130.
The previous prime is 100110110101. The next prime is 100110110141. The reversal of 100110110131 is 131011011001.
It is an a-pointer prime, because the next prime (100110110141) can be obtained adding 100110110131 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100110110131 - 25 = 100110110099 is a prime.
It is a super-2 number, since 2×1001101101312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100110110101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055055065 + 50055055066.
It is an arithmetic number, because the mean of its divisors is an integer number (50055055066).
Almost surely, 2100110110131 is an apocalyptic number.
100110110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110110131 is an equidigital number, since it uses as much as digits as its factorization.
100110110131 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 10.
Adding to 100110110131 its reverse (131011011001), we get a palindrome (231121121132).
The spelling of 100110110131 in words is "one hundred billion, one hundred ten million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •