Base | Representation |
---|---|
bin | 11101110111000111100011… |
… | …100001110110110011000101 |
3 | 122020000010100110010120121222 |
4 | 131313013203201312303011 |
5 | 114203211423233004104 |
6 | 1143152350543450125 |
7 | 36443232260534033 |
oct | 3567074341666305 |
9 | 566003313116558 |
10 | 131331032313029 |
11 | 389341a5a4750a |
12 | 12890a00bb6945 |
13 | 5838603886613 |
14 | 2460654d11553 |
15 | 102b34ca5d1be |
hex | 7771e3876cc5 |
131331032313029 has 2 divisors, whose sum is σ = 131331032313030. Its totient is φ = 131331032313028.
The previous prime is 131331032312939. The next prime is 131331032313043. The reversal of 131331032313029 is 920313230133131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75886225012900 + 55444807300129 = 8711270^2 + 7446127^2 .
It is a cyclic number.
It is not a de Polignac number, because 131331032313029 - 28 = 131331032312773 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131331032313029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131331032343029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65665516156514 + 65665516156515.
It is an arithmetic number, because the mean of its divisors is an integer number (65665516156515).
Almost surely, 2131331032313029 is an apocalyptic number.
It is an amenable number.
131331032313029 is a deficient number, since it is larger than the sum of its proper divisors (1).
131331032313029 is an equidigital number, since it uses as much as digits as its factorization.
131331032313029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26244, while the sum is 35.
The spelling of 131331032313029 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, thirty-two million, three hundred thirteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.760 sec. • engine limits •