Base | Representation |
---|---|
bin | 11101110110111101100100… |
… | …000001100101011011000101 |
3 | 122012222002122201102210020021 |
4 | 131312331210001211123011 |
5 | 114203022440110242404 |
6 | 1143143414153535141 |
7 | 36442402350635545 |
oct | 3566754401453305 |
9 | 565862581383207 |
10 | 131320303212229 |
11 | 3892a69a71725a |
12 | 1288a907a144b1 |
13 | 58375b3b0b171 |
14 | 245dd17ddb325 |
15 | 102ae20b80454 |
hex | 776f640656c5 |
131320303212229 has 2 divisors, whose sum is σ = 131320303212230. Its totient is φ = 131320303212228.
The previous prime is 131320303212221. The next prime is 131320303212247. The reversal of 131320303212229 is 922212303023131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98528989835329 + 32791313376900 = 9926177^2 + 5726370^2 .
It is a cyclic number.
It is not a de Polignac number, because 131320303212229 - 23 = 131320303212221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131320303212194 and 131320303212203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131320303212221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65660151606114 + 65660151606115.
It is an arithmetic number, because the mean of its divisors is an integer number (65660151606115).
Almost surely, 2131320303212229 is an apocalyptic number.
It is an amenable number.
131320303212229 is a deficient number, since it is larger than the sum of its proper divisors (1).
131320303212229 is an equidigital number, since it uses as much as digits as its factorization.
131320303212229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 34.
The spelling of 131320303212229 in words is "one hundred thirty-one trillion, three hundred twenty billion, three hundred three million, two hundred twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •