Base | Representation |
---|---|
bin | 111101000110001000… |
… | …0110011001110000101 |
3 | 110112122201011000120011 |
4 | 1322030100303032011 |
5 | 4122200232430341 |
6 | 140135023110221 |
7 | 12323212403323 |
oct | 1721420631605 |
9 | 415581130504 |
10 | 131202233221 |
11 | 50708270804 |
12 | 21517442371 |
13 | c4abc9b637 |
14 | 64c901ad13 |
15 | 362d690b81 |
hex | 1e8c433385 |
131202233221 has 2 divisors, whose sum is σ = 131202233222. Its totient is φ = 131202233220.
The previous prime is 131202233213. The next prime is 131202233237. The reversal of 131202233221 is 122332202131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120069873121 + 11132360100 = 346511^2 + 105510^2 .
It is a cyclic number.
It is not a de Polignac number, because 131202233221 - 23 = 131202233213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131202233192 and 131202233201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131202230221) 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, 65601116610 + 65601116611.
It is an arithmetic number, because the mean of its divisors is an integer number (65601116611).
Almost surely, 2131202233221 is an apocalyptic number.
It is an amenable number.
131202233221 is a deficient number, since it is larger than the sum of its proper divisors (1).
131202233221 is an equidigital number, since it uses as much as digits as its factorization.
131202233221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 131202233221 its reverse (122332202131), we get a palindrome (253534435352).
The spelling of 131202233221 in words is "one hundred thirty-one billion, two hundred two million, two hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •