Base | Representation |
---|---|
bin | 11101110010010101101111… |
… | …010101100001010010001101 |
3 | 122011211201202222212110010221 |
4 | 131302111233111201102031 |
5 | 114132321424321021004 |
6 | 1142341443233231341 |
7 | 36410426113100311 |
oct | 3562255725412215 |
9 | 564751688773127 |
10 | 131002665407629 |
11 | 38817a11432344 |
12 | 1283923b702551 |
13 | 5813662b150b2 |
14 | 244c7c45d1b41 |
15 | 1022a2ed10354 |
hex | 77256f56148d |
131002665407629 has 2 divisors, whose sum is σ = 131002665407630. Its totient is φ = 131002665407628.
The previous prime is 131002665407617. The next prime is 131002665407641. The reversal of 131002665407629 is 926704566200131.
It is a balanced prime because it is at equal distance from previous prime (131002665407617) and next prime (131002665407641).
It can be written as a sum of positive squares in only one way, i.e., 126497213421604 + 4505451986025 = 11247098^2 + 2122605^2 .
It is a cyclic number.
It is not a de Polignac number, because 131002665407629 - 217 = 131002665276557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131002665467629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65501332703814 + 65501332703815.
It is an arithmetic number, because the mean of its divisors is an integer number (65501332703815).
Almost surely, 2131002665407629 is an apocalyptic number.
It is an amenable number.
131002665407629 is a deficient number, since it is larger than the sum of its proper divisors (1).
131002665407629 is an equidigital number, since it uses as much as digits as its factorization.
131002665407629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3265920, while the sum is 52.
The spelling of 131002665407629 in words is "one hundred thirty-one trillion, two billion, six hundred sixty-five million, four hundred seven thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •