Base | Representation |
---|---|
bin | 11101110100001110011001… |
… | …011101110001100001001101 |
3 | 122012022010011222000022001001 |
4 | 131310032121131301201031 |
5 | 114141432242113430404 |
6 | 1142521151044220301 |
7 | 36422663454330466 |
oct | 3564163135614115 |
9 | 565263158008031 |
10 | 131132221233229 |
11 | 38867954304697 |
12 | 1285a37769a691 |
13 | 582293b97c728 |
14 | 2454b94ab7d6d |
15 | 10260b3b867a4 |
hex | 77439977184d |
131132221233229 has 2 divisors, whose sum is σ = 131132221233230. Its totient is φ = 131132221233228.
The previous prime is 131132221233199. The next prime is 131132221233257. The reversal of 131132221233229 is 922332122231131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128936638170729 + 2195583062500 = 11355027^2 + 1481750^2 .
It is a cyclic number.
It is not a de Polignac number, because 131132221233229 - 219 = 131132220708941 is a prime.
It is a super-2 number, since 2×1311322212332292 (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 (131132221233329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65566110616614 + 65566110616615.
It is an arithmetic number, because the mean of its divisors is an integer number (65566110616615).
Almost surely, 2131132221233229 is an apocalyptic number.
It is an amenable number.
131132221233229 is a deficient number, since it is larger than the sum of its proper divisors (1).
131132221233229 is an equidigital number, since it uses as much as digits as its factorization.
131132221233229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 37.
The spelling of 131132221233229 in words is "one hundred thirty-one trillion, one hundred thirty-two billion, two hundred twenty-one million, two hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •