Base | Representation |
---|---|
bin | 11101111000001010110111… |
… | …101100000000111010011101 |
3 | 122020021000220200122121111102 |
4 | 131320022313230000322131 |
5 | 114210402440133104204 |
6 | 1143245503043402445 |
7 | 36451401356244311 |
oct | 3570126754007235 |
9 | 566230820577442 |
10 | 131403311222429 |
11 | 38961916564984 |
12 | 128a2a13083425 |
13 | 58423821a046c |
14 | 2463d50465b41 |
15 | 102d17d27641e |
hex | 7782b7b00e9d |
131403311222429 has 2 divisors, whose sum is σ = 131403311222430. Its totient is φ = 131403311222428.
The previous prime is 131403311222383. The next prime is 131403311222501. The reversal of 131403311222429 is 924222113304131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103707542016100 + 27695769206329 = 10183690^2 + 5262677^2 .
It is a cyclic number.
It is not a de Polignac number, because 131403311222429 - 216 = 131403311156893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131403311222392 and 131403311222401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131403311222929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65701655611214 + 65701655611215.
It is an arithmetic number, because the mean of its divisors is an integer number (65701655611215).
Almost surely, 2131403311222429 is an apocalyptic number.
It is an amenable number.
131403311222429 is a deficient number, since it is larger than the sum of its proper divisors (1).
131403311222429 is an equidigital number, since it uses as much as digits as its factorization.
131403311222429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 38.
The spelling of 131403311222429 in words is "one hundred thirty-one trillion, four hundred three billion, three hundred eleven million, two hundred twenty-two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •