Base | Representation |
---|---|
bin | 1011110001011000001… |
… | …0000110011000111001 |
3 | 201022222222021112102202 |
4 | 2330112002012120321 |
5 | 11303133134041441 |
6 | 232523221235545 |
7 | 20416345042655 |
oct | 2742602063071 |
9 | 638888245382 |
10 | 202233112121 |
11 | 78848357407 |
12 | 3323b562bb5 |
13 | 160bbb751b1 |
14 | 9b068dba65 |
15 | 53d953219b |
hex | 2f16086639 |
202233112121 has 2 divisors, whose sum is σ = 202233112122. Its totient is φ = 202233112120.
The previous prime is 202233112099. The next prime is 202233112127. The reversal of 202233112121 is 121211332202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 146141821225 + 56091290896 = 382285^2 + 236836^2 .
It is a cyclic number.
It is not a de Polignac number, because 202233112121 - 214 = 202233095737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202233112093 and 202233112102.
It is not a weakly prime, because it can be changed into another prime (202233112127) 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, 101116556060 + 101116556061.
It is an arithmetic number, because the mean of its divisors is an integer number (101116556061).
Almost surely, 2202233112121 is an apocalyptic number.
It is an amenable number.
202233112121 is a deficient number, since it is larger than the sum of its proper divisors (1).
202233112121 is an equidigital number, since it uses as much as digits as its factorization.
202233112121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 202233112121 its reverse (121211332202), we get a palindrome (323444444323).
The spelling of 202233112121 in words is "two hundred two billion, two hundred thirty-three million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •