Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0011011011110111101 |
3 | 201020010112221222201221 |
4 | 2323103310123132331 |
5 | 11243344242413003 |
6 | 232221055233341 |
7 | 20346665524105 |
oct | 2732364333675 |
9 | 636115858657 |
10 | 201122232253 |
11 | 78328290978 |
12 | 32b8b518851 |
13 | 15c72985327 |
14 | 9a3d16a205 |
15 | 5371c4c7bd |
hex | 2ed3d1b7bd |
201122232253 has 2 divisors, whose sum is σ = 201122232254. Its totient is φ = 201122232252.
The previous prime is 201122232251. The next prime is 201122232277. The reversal of 201122232253 is 352232221102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 160526832964 + 40595399289 = 400658^2 + 201483^2 .
It is a cyclic number.
It is not a de Polignac number, because 201122232253 - 21 = 201122232251 is a prime.
It is a super-4 number, since 4×2011222322534 (a number of 46 digits) contains 4444 as substring.
Together with 201122232251, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201122232251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100561116126 + 100561116127.
It is an arithmetic number, because the mean of its divisors is an integer number (100561116127).
Almost surely, 2201122232253 is an apocalyptic number.
It is an amenable number.
201122232253 is a deficient number, since it is larger than the sum of its proper divisors (1).
201122232253 is an equidigital number, since it uses as much as digits as its factorization.
201122232253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 201122232253 its reverse (352232221102), we get a palindrome (553354453355).
The spelling of 201122232253 in words is "two hundred one billion, one hundred twenty-two million, two hundred thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •