Base | Representation |
---|---|
bin | 11101110101001110110000… |
… | …001010000111110100011101 |
3 | 122012112201112200020012221222 |
4 | 131311032300022013310131 |
5 | 114144100301241400042 |
6 | 1143013015513303125 |
7 | 36430661024340104 |
oct | 3565166012076435 |
9 | 565481480205858 |
10 | 131201321434397 |
11 | 388941935a1565 |
12 | 1286b841104aa5 |
13 | 5829301871126 |
14 | 245826bdc703b |
15 | 1027caa2aa2d2 |
hex | 7753b0287d1d |
131201321434397 has 2 divisors, whose sum is σ = 131201321434398. Its totient is φ = 131201321434396.
The previous prime is 131201321434363. The next prime is 131201321434481. The reversal of 131201321434397 is 793434123102131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84991970753881 + 46209350680516 = 9219109^2 + 6797746^2 .
It is a cyclic number.
It is not a de Polignac number, because 131201321434397 - 26 = 131201321434333 is a prime.
It is a super-2 number, since 2×1312013214343972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131201321434327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600660717198 + 65600660717199.
It is an arithmetic number, because the mean of its divisors is an integer number (65600660717199).
Almost surely, 2131201321434397 is an apocalyptic number.
It is an amenable number.
131201321434397 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201321434397 is an equidigital number, since it uses as much as digits as its factorization.
131201321434397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 44.
The spelling of 131201321434397 in words is "one hundred thirty-one trillion, two hundred one billion, three hundred twenty-one million, four hundred thirty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •