Base | Representation |
---|---|
bin | 11101110010010100010010… |
… | …101100100110010100101011 |
3 | 122011211120202200022022211201 |
4 | 131302110102230212110223 |
5 | 114132310233430121431 |
6 | 1142341025112505031 |
7 | 36410342441253223 |
oct | 3562242254462453 |
9 | 564746680268751 |
10 | 131001111176491 |
11 | 388172940814a6 |
12 | 12838a870ab177 |
13 | 5813475b158ba |
14 | 244c6b8013083 |
15 | 102298d652461 |
hex | 772512b2652b |
131001111176491 has 2 divisors, whose sum is σ = 131001111176492. Its totient is φ = 131001111176490.
The previous prime is 131001111176479. The next prime is 131001111176513. The reversal of 131001111176491 is 194671111100131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131001111176491 - 27 = 131001111176363 is a prime.
It is a super-2 number, since 2×1310011111764912 (a number of 29 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 131001111176491.
It is not a weakly prime, because it can be changed into another prime (131001111176791) 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, 65500555588245 + 65500555588246.
It is an arithmetic number, because the mean of its divisors is an integer number (65500555588246).
Almost surely, 2131001111176491 is an apocalyptic number.
131001111176491 is a deficient number, since it is larger than the sum of its proper divisors (1).
131001111176491 is an equidigital number, since it uses as much as digits as its factorization.
131001111176491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 37.
The spelling of 131001111176491 in words is "one hundred thirty-one trillion, one billion, one hundred eleven million, one hundred seventy-six thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •