Base | Representation |
---|---|
bin | 1001001101101100111111… |
… | …0110011010010010110101 |
3 | 1022212111221012112110010221 |
4 | 2103123033312122102311 |
5 | 2311441312111444112 |
6 | 33314043143014341 |
7 | 2063641056261364 |
oct | 223331766322265 |
9 | 38774835473127 |
10 | 10131020031157 |
11 | 32565a5768703 |
12 | 117756213a3b1 |
13 | 58647446188c |
14 | 2704b5c7b7db |
15 | 1287e75e2e07 |
hex | 936cfd9a4b5 |
10131020031157 has 2 divisors, whose sum is σ = 10131020031158. Its totient is φ = 10131020031156.
The previous prime is 10131020031113. The next prime is 10131020031241. The reversal of 10131020031157 is 75113002013101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8958533872561 + 1172486158596 = 2993081^2 + 1082814^2 .
It is a cyclic number.
It is not a de Polignac number, because 10131020031157 - 219 = 10131019506869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10131020031757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065510015578 + 5065510015579.
It is an arithmetic number, because the mean of its divisors is an integer number (5065510015579).
Almost surely, 210131020031157 is an apocalyptic number.
It is an amenable number.
10131020031157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131020031157 is an equidigital number, since it uses as much as digits as its factorization.
10131020031157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 25.
Adding to 10131020031157 its reverse (75113002013101), we get a palindrome (85244022044258).
The spelling of 10131020031157 in words is "ten trillion, one hundred thirty-one billion, twenty million, thirty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •