Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100010000011010110011 |
3 | 10220020220021202200100002 |
4 | 100001121110100122303 |
5 | 121014332042011011 |
6 | 2201444055420215 |
7 | 142355025344021 |
oct | 20013124203263 |
9 | 3806807680302 |
10 | 1101010110131 |
11 | 394a3255a758 |
12 | 15947208466b |
13 | 7ca95145189 |
14 | 3b4096c7711 |
15 | 1d98e4ccc3b |
hex | 100595106b3 |
1101010110131 has 2 divisors, whose sum is σ = 1101010110132. Its totient is φ = 1101010110130.
The previous prime is 1101010110073. The next prime is 1101010110157. The reversal of 1101010110131 is 1310110101011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101010110131 is a prime.
It is a super-2 number, since 2×11010101101312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1101010110181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505055065 + 550505055066.
It is an arithmetic number, because the mean of its divisors is an integer number (550505055066).
Almost surely, 21101010110131 is an apocalyptic number.
1101010110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010110131 is an equidigital number, since it uses as much as digits as its factorization.
1101010110131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 1101010110131 its reverse (1310110101011), we get a palindrome (2411120211142).
The spelling of 1101010110131 in words is "one trillion, one hundred one billion, 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 •