Base | Representation |
---|---|
bin | 11101110011110011100100… |
… | …010000010001000001110111 |
3 | 122012012100211010212121012211 |
4 | 131303303210100101001313 |
5 | 114140444241232244112 |
6 | 1142500024201354251 |
7 | 36420623514232624 |
oct | 3563634420210167 |
9 | 565170733777184 |
10 | 131103411212407 |
11 | 3885670a852627 |
12 | 12854877198987 |
13 | 581ccc9cb092a |
14 | 245362071134b |
15 | 10254797690a7 |
hex | 773ce4411077 |
131103411212407 has 2 divisors, whose sum is σ = 131103411212408. Its totient is φ = 131103411212406.
The previous prime is 131103411212377. The next prime is 131103411212447. The reversal of 131103411212407 is 704212114301131.
It is a weak prime.
It is an emirp because it is prime and its reverse (704212114301131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131103411212407 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131103411212447) 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, 65551705606203 + 65551705606204.
It is an arithmetic number, because the mean of its divisors is an integer number (65551705606204).
Almost surely, 2131103411212407 is an apocalyptic number.
131103411212407 is a deficient number, since it is larger than the sum of its proper divisors (1).
131103411212407 is an equidigital number, since it uses as much as digits as its factorization.
131103411212407 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 131103411212407 its reverse (704212114301131), we get a palindrome (835315525513538).
The spelling of 131103411212407 in words is "one hundred thirty-one trillion, one hundred three billion, four hundred eleven million, two hundred twelve thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •