Base | Representation |
---|---|
bin | 11101110010011100101011… |
… | …101111001010010000110111 |
3 | 122011212110000121021121022222 |
4 | 131302130223233022100313 |
5 | 114132432212012303413 |
6 | 1142345115133112555 |
7 | 36411111635305205 |
oct | 3562345357122067 |
9 | 564773017247288 |
10 | 131010121212983 |
11 | 38820097aa8251 |
12 | 1283a78062875b |
13 | 581428069b23c |
14 | 244ccd08bc075 |
15 | 1022d19662b08 |
hex | 77272bbca437 |
131010121212983 has 2 divisors, whose sum is σ = 131010121212984. Its totient is φ = 131010121212982.
The previous prime is 131010121212847. The next prime is 131010121213003. The reversal of 131010121212983 is 389212121010131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131010121212983 - 28 = 131010121212727 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131010124212983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65505060606491 + 65505060606492.
It is an arithmetic number, because the mean of its divisors is an integer number (65505060606492).
Almost surely, 2131010121212983 is an apocalyptic number.
131010121212983 is a deficient number, since it is larger than the sum of its proper divisors (1).
131010121212983 is an equidigital number, since it uses as much as digits as its factorization.
131010121212983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 35.
The spelling of 131010121212983 in words is "one hundred thirty-one trillion, ten billion, one hundred twenty-one million, two hundred twelve thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •