Base | Representation |
---|---|
bin | 111101000001000000… |
… | …0001101100101011001 |
3 | 110112012201021101110101 |
4 | 1322002000031211121 |
5 | 4121322202100401 |
6 | 140105554015401 |
7 | 12316022403043 |
oct | 1720200154531 |
9 | 415181241411 |
10 | 131030112601 |
11 | 5062a09aa63 |
12 | 21489877561 |
13 | c48242600b |
14 | 64b0214a93 |
15 | 361d4e2101 |
hex | 1e8200d959 |
131030112601 has 2 divisors, whose sum is σ = 131030112602. Its totient is φ = 131030112600.
The previous prime is 131030112599. The next prime is 131030112667. The reversal of 131030112601 is 106211030131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93025000000 + 38005112601 = 305000^2 + 194949^2 .
It is a cyclic number.
It is not a de Polignac number, because 131030112601 - 21 = 131030112599 is a prime.
Together with 131030112599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (131030112671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65515056300 + 65515056301.
It is an arithmetic number, because the mean of its divisors is an integer number (65515056301).
Almost surely, 2131030112601 is an apocalyptic number.
It is an amenable number.
131030112601 is a deficient number, since it is larger than the sum of its proper divisors (1).
131030112601 is an equidigital number, since it uses as much as digits as its factorization.
131030112601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131030112601 its reverse (106211030131), we get a palindrome (237241142732).
The spelling of 131030112601 in words is "one hundred thirty-one billion, thirty million, one hundred twelve thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •