Base | Representation |
---|---|
bin | 111101000000100101… |
… | …0011110011110001101 |
3 | 110112011201202201021022 |
4 | 1322001022132132031 |
5 | 4121310100312442 |
6 | 140104332043525 |
7 | 12315461563163 |
oct | 1720112363615 |
9 | 415151681238 |
10 | 131016025997 |
11 | 5062214953a |
12 | 214850035a5 |
13 | c47c53334c |
14 | 64ac3c9233 |
15 | 361c15d3d2 |
hex | 1e8129e78d |
131016025997 has 2 divisors, whose sum is σ = 131016025998. Its totient is φ = 131016025996.
The previous prime is 131016025993. The next prime is 131016025999. The reversal of 131016025997 is 799520610131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130791445801 + 224580196 = 361651^2 + 14986^2 .
It is an emirp because it is prime and its reverse (799520610131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131016025997 - 22 = 131016025993 is a prime.
Together with 131016025999, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131016025993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65508012998 + 65508012999.
It is an arithmetic number, because the mean of its divisors is an integer number (65508012999).
Almost surely, 2131016025997 is an apocalyptic number.
It is an amenable number.
131016025997 is a deficient number, since it is larger than the sum of its proper divisors (1).
131016025997 is an equidigital number, since it uses as much as digits as its factorization.
131016025997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 44.
The spelling of 131016025997 in words is "one hundred thirty-one billion, sixteen million, twenty-five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •