Base | Representation |
---|---|
bin | 11101111001011001000100… |
… | …001100011010010111000011 |
3 | 122020120001122010100222010022 |
4 | 131321121010030122113003 |
5 | 114213241413330413011 |
6 | 1143352230321524055 |
7 | 36460433124620324 |
oct | 3571310414322703 |
9 | 566501563328108 |
10 | 131487272904131 |
11 | 38994491763071 |
12 | 128b71457a362b |
13 | 584a272ccb721 |
14 | 246803741c44b |
15 | 103044444b8db |
hex | 77964431a5c3 |
131487272904131 has 2 divisors, whose sum is σ = 131487272904132. Its totient is φ = 131487272904130.
The previous prime is 131487272904079. The next prime is 131487272904157. The reversal of 131487272904131 is 131409272784131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131487272904131 - 26 = 131487272904067 is a prime.
It is a super-2 number, since 2×1314872729041312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131487272924131) 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, 65743636452065 + 65743636452066.
It is an arithmetic number, because the mean of its divisors is an integer number (65743636452066).
Almost surely, 2131487272904131 is an apocalyptic number.
131487272904131 is a deficient number, since it is larger than the sum of its proper divisors (1).
131487272904131 is an equidigital number, since it uses as much as digits as its factorization.
131487272904131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2032128, while the sum is 53.
The spelling of 131487272904131 in words is "one hundred thirty-one trillion, four hundred eighty-seven billion, two hundred seventy-two million, nine hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •