Base | Representation |
---|---|
bin | 11101110010010111000110… |
… | …110000100000100001101111 |
3 | 122011211212120012201011010021 |
4 | 131302113012300200201233 |
5 | 114132332430304201312 |
6 | 1142342244545423011 |
7 | 36410510342553052 |
oct | 3562270660404157 |
9 | 564755505634107 |
10 | 131004132100207 |
11 | 388185a4333173 |
12 | 1283958a93aa67 |
13 | 5813837944b22 |
14 | 244c8c3304a99 |
15 | 1022ab897ac07 |
hex | 7725c6c2086f |
131004132100207 has 2 divisors, whose sum is σ = 131004132100208. Its totient is φ = 131004132100206.
The previous prime is 131004132100147. The next prime is 131004132100253. The reversal of 131004132100207 is 702001231400131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131004132100207 is a prime.
It is a super-2 number, since 2×1310041321002072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131004132100267) 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, 65502066050103 + 65502066050104.
It is an arithmetic number, because the mean of its divisors is an integer number (65502066050104).
Almost surely, 2131004132100207 is an apocalyptic number.
131004132100207 is a deficient number, since it is larger than the sum of its proper divisors (1).
131004132100207 is an equidigital number, since it uses as much as digits as its factorization.
131004132100207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
Adding to 131004132100207 its reverse (702001231400131), we get a palindrome (833005363500338).
The spelling of 131004132100207 in words is "one hundred thirty-one trillion, four billion, one hundred thirty-two million, one hundred thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •