Base | Representation |
---|---|
bin | 10010110100001001… |
… | …10000100100001011 |
3 | 222001222001122111122 |
4 | 21122010300210023 |
5 | 131141342202111 |
6 | 4350154145455 |
7 | 505213126031 |
oct | 113204604413 |
9 | 28058048448 |
10 | 10101131531 |
11 | 4313909697 |
12 | 1b5aa2228b |
13 | c4c93900a |
14 | 6bb76a551 |
15 | 3e1bd7cdb |
hex | 25a13090b |
10101131531 has 2 divisors, whose sum is σ = 10101131532. Its totient is φ = 10101131530.
The previous prime is 10101131527. The next prime is 10101131533. The reversal of 10101131531 is 13513110101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10101131531 - 22 = 10101131527 is a prime.
It is a super-2 number, since 2×101011315312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 10101131533, 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 (10101131533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050565765 + 5050565766.
It is an arithmetic number, because the mean of its divisors is an integer number (5050565766).
Almost surely, 210101131531 is an apocalyptic number.
10101131531 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101131531 is an equidigital number, since it uses as much as digits as its factorization.
10101131531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 17.
Adding to 10101131531 its reverse (13513110101), we get a palindrome (23614241632).
The spelling of 10101131531 in words is "ten billion, one hundred one million, one hundred thirty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •