Base | Representation |
---|---|
bin | 101111001011110111… |
… | …1101100111010000011 |
3 | 100200112212111001001222 |
4 | 1132113233230322003 |
5 | 3130011002042011 |
6 | 114314515545255 |
7 | 10215024512303 |
oct | 1362757547203 |
9 | 320485431058 |
10 | 101330112131 |
11 | 39a79230026 |
12 | 1777b2bb22b |
13 | 972b25b741 |
14 | 4c9397d603 |
15 | 2980dc6ddb |
hex | 1797bece83 |
101330112131 has 2 divisors, whose sum is σ = 101330112132. Its totient is φ = 101330112130.
The previous prime is 101330112097. The next prime is 101330112133. The reversal of 101330112131 is 131211033101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101330112131 is a prime.
It is a super-2 number, since 2×1013301121312 (a number of 23 digits) contains 22 as substring.
Together with 101330112133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101330112133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50665056065 + 50665056066.
It is an arithmetic number, because the mean of its divisors is an integer number (50665056066).
Almost surely, 2101330112131 is an apocalyptic number.
101330112131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101330112131 is an equidigital number, since it uses as much as digits as its factorization.
101330112131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 101330112131 its reverse (131211033101), we get a palindrome (232541145232).
The spelling of 101330112131 in words is "one hundred one billion, three hundred thirty million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •