Base | Representation |
---|---|
bin | 11101110010010100001010… |
… | …101100100110011001010111 |
3 | 122011211120102022202101010212 |
4 | 131302110022230212121113 |
5 | 114132310000100142223 |
6 | 1142341003520040035 |
7 | 36410336221365611 |
oct | 3562241254463127 |
9 | 564746368671125 |
10 | 131000976959063 |
11 | 38817225339a02 |
12 | 12838a4a16301b |
13 | 58134540815c3 |
14 | 244c6a4275db1 |
15 | 102298198e278 |
hex | 77250ab26657 |
131000976959063 has 2 divisors, whose sum is σ = 131000976959064. Its totient is φ = 131000976959062.
The previous prime is 131000976959029. The next prime is 131000976959071. The reversal of 131000976959063 is 360959679000131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131000976959063 - 246 = 60632232781399 is a prime.
It is a super-2 number, since 2×1310009769590632 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131000976958993 and 131000976959011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131000976959263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500488479531 + 65500488479532.
It is an arithmetic number, because the mean of its divisors is an integer number (65500488479532).
Almost surely, 2131000976959063 is an apocalyptic number.
131000976959063 is a deficient number, since it is larger than the sum of its proper divisors (1).
131000976959063 is an equidigital number, since it uses as much as digits as its factorization.
131000976959063 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8266860, while the sum is 59.
The spelling of 131000976959063 in words is "one hundred thirty-one trillion, nine hundred seventy-six million, nine hundred fifty-nine thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •