Base | Representation |
---|---|
bin | 111101000110000110… |
… | …0100001110010001101 |
3 | 110112122122001010012222 |
4 | 1322030030201302031 |
5 | 4122144441110404 |
6 | 140134543105125 |
7 | 12323200030124 |
oct | 1721414416215 |
9 | 415578033188 |
10 | 131201113229 |
11 | 5070767629a |
12 | 21516ba21a5 |
13 | c4ab998914 |
14 | 64c8c08abb |
15 | 362d51ddbe |
hex | 1e8c321c8d |
131201113229 has 2 divisors, whose sum is σ = 131201113230. Its totient is φ = 131201113228.
The previous prime is 131201113091. The next prime is 131201113237. The reversal of 131201113229 is 922311102131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91080222025 + 40120891204 = 301795^2 + 200302^2 .
It is a cyclic number.
It is not a de Polignac number, because 131201113229 - 224 = 131184336013 is a prime.
It is a super-2 number, since 2×1312011132292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131201113198 and 131201113207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131201113279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65600556614 + 65600556615.
It is an arithmetic number, because the mean of its divisors is an integer number (65600556615).
Almost surely, 2131201113229 is an apocalyptic number.
It is an amenable number.
131201113229 is a deficient number, since it is larger than the sum of its proper divisors (1).
131201113229 is an equidigital number, since it uses as much as digits as its factorization.
131201113229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 131201113229 in words is "one hundred thirty-one billion, two hundred one million, one hundred thirteen thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •