Base | Representation |
---|---|
bin | 111101001111001110… |
… | …1111011011001100111 |
3 | 110120102222212112111021 |
4 | 1322132131323121213 |
5 | 4123311430230422 |
6 | 140225213352011 |
7 | 12333611463433 |
oct | 1723635733147 |
9 | 416388775437 |
10 | 131507664487 |
11 | 50854714841 |
12 | 215a1798607 |
13 | c52a34b5b4 |
14 | 65178059c3 |
15 | 364a3c3dc7 |
hex | 1e9e77b667 |
131507664487 has 2 divisors, whose sum is σ = 131507664488. Its totient is φ = 131507664486.
The previous prime is 131507664427. The next prime is 131507664539. The reversal of 131507664487 is 784466705131.
It is a happy number.
It is an a-pointer prime, because the next prime (131507664539) can be obtained adding 131507664487 to its sum of digits (52).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131507664487 - 219 = 131507140199 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131507664427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65753832243 + 65753832244.
It is an arithmetic number, because the mean of its divisors is an integer number (65753832244).
Almost surely, 2131507664487 is an apocalyptic number.
131507664487 is a deficient number, since it is larger than the sum of its proper divisors (1).
131507664487 is an equidigital number, since it uses as much as digits as its factorization.
131507664487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3386880, while the sum is 52.
The spelling of 131507664487 in words is "one hundred thirty-one billion, five hundred seven million, six hundred sixty-four thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •