Base | Representation |
---|---|
bin | 10010110100001001… |
… | …10000100011110011 |
3 | 222001222001122110202 |
4 | 21122010300203303 |
5 | 131141342202012 |
6 | 4350154145415 |
7 | 505213125665 |
oct | 113204604363 |
9 | 28058048422 |
10 | 10101131507 |
11 | 4313909675 |
12 | 1b5aa2226b |
13 | c4c938cbc |
14 | 6bb76a535 |
15 | 3e1bd7cc2 |
hex | 25a1308f3 |
10101131507 has 2 divisors, whose sum is σ = 10101131508. Its totient is φ = 10101131506.
The previous prime is 10101131389. The next prime is 10101131527. The reversal of 10101131507 is 70513110101.
It is an a-pointer prime, because the next prime (10101131527) can be obtained adding 10101131507 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10101131507 - 212 = 10101127411 is a prime.
It is not a weakly prime, because it can be changed into another prime (10101131527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050565753 + 5050565754.
It is an arithmetic number, because the mean of its divisors is an integer number (5050565754).
Almost surely, 210101131507 is an apocalyptic number.
10101131507 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101131507 is an equidigital number, since it uses as much as digits as its factorization.
10101131507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105, while the sum is 20.
Adding to 10101131507 its reverse (70513110101), we get a palindrome (80614241608).
The spelling of 10101131507 in words is "ten billion, one hundred one million, one hundred thirty-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •