Base | Representation |
---|---|
bin | 11101110010010011100011… |
… | …100111110110011000000001 |
3 | 122011211111201122012122102022 |
4 | 131302103203213312120001 |
5 | 114132302124234333434 |
6 | 1142340414501131225 |
7 | 36410314041266606 |
oct | 3562234347663001 |
9 | 564744648178368 |
10 | 131000321402369 |
11 | 38816a19295511 |
12 | 128388a66b9b15 |
13 | 581337b303333 |
14 | 244c64118a6ad |
15 | 102294414a22e |
hex | 7724e39f6601 |
131000321402369 has 2 divisors, whose sum is σ = 131000321402370. Its totient is φ = 131000321402368.
The previous prime is 131000321402311. The next prime is 131000321402381. The reversal of 131000321402369 is 963204123000131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73631209824769 + 57369111577600 = 8580863^2 + 7574240^2 .
It is an emirp because it is prime and its reverse (963204123000131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131000321402369 - 236 = 130931601925633 is a prime.
It is a super-2 number, since 2×1310003214023692 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131000321402569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500160701184 + 65500160701185.
It is an arithmetic number, because the mean of its divisors is an integer number (65500160701185).
Almost surely, 2131000321402369 is an apocalyptic number.
It is an amenable number.
131000321402369 is a deficient number, since it is larger than the sum of its proper divisors (1).
131000321402369 is an equidigital number, since it uses as much as digits as its factorization.
131000321402369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 131000321402369 in words is "one hundred thirty-one trillion, three hundred twenty-one million, four hundred two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •