Base | Representation |
---|---|
bin | 111101000001110010… |
… | …0100010110111001101 |
3 | 110112021112202122102002 |
4 | 1322003210202313031 |
5 | 4121400420223112 |
6 | 140112333442045 |
7 | 12316462066004 |
oct | 1720344426715 |
9 | 415245678362 |
10 | 131056414157 |
11 | 50642a24789 |
12 | 21496640325 |
13 | c487a04776 |
14 | 64b38ddc3b |
15 | 362098a1c2 |
hex | 1e83922dcd |
131056414157 has 2 divisors, whose sum is σ = 131056414158. Its totient is φ = 131056414156.
The previous prime is 131056414123. The next prime is 131056414189. The reversal of 131056414157 is 751414650131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124415631076 + 6640783081 = 352726^2 + 81491^2 .
It is a cyclic number.
It is not a de Polignac number, because 131056414157 - 224 = 131039636941 is a prime.
It is a super-2 number, since 2×1310564141572 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 131056414157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131056410157) 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, 65528207078 + 65528207079.
It is an arithmetic number, because the mean of its divisors is an integer number (65528207079).
Almost surely, 2131056414157 is an apocalyptic number.
It is an amenable number.
131056414157 is a deficient number, since it is larger than the sum of its proper divisors (1).
131056414157 is an equidigital number, since it uses as much as digits as its factorization.
131056414157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 38.
The spelling of 131056414157 in words is "one hundred thirty-one billion, fifty-six million, four hundred fourteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •