Base | Representation |
---|---|
bin | 111101000000111111… |
… | …1000010111110111101 |
3 | 110112012200200212022012 |
4 | 1322001333002332331 |
5 | 4121322112311122 |
6 | 140105543301005 |
7 | 12316016661143 |
oct | 1720177027675 |
9 | 415180625265 |
10 | 131029807037 |
11 | 50629a01428 |
12 | 2148974a765 |
13 | c482349bcc |
14 | 64b0175593 |
15 | 361d4817e2 |
hex | 1e81fc2fbd |
131029807037 has 2 divisors, whose sum is σ = 131029807038. Its totient is φ = 131029807036.
The previous prime is 131029807031. The next prime is 131029807067. The reversal of 131029807037 is 730708920131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127919960281 + 3109846756 = 357659^2 + 55766^2 .
It is an emirp because it is prime and its reverse (730708920131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131029807037 - 212 = 131029802941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131029806985 and 131029807003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131029807031) 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, 65514903518 + 65514903519.
It is an arithmetic number, because the mean of its divisors is an integer number (65514903519).
Almost surely, 2131029807037 is an apocalyptic number.
It is an amenable number.
131029807037 is a deficient number, since it is larger than the sum of its proper divisors (1).
131029807037 is an equidigital number, since it uses as much as digits as its factorization.
131029807037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504, while the sum is 41.
The spelling of 131029807037 in words is "one hundred thirty-one billion, twenty-nine million, eight hundred seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •