Base | Representation |
---|---|
bin | 1011110001010010111… |
… | …0100101101010011001 |
3 | 201022221110002022020221 |
4 | 2330110232211222121 |
5 | 11303112033020441 |
6 | 232521120120041 |
7 | 20415661003621 |
oct | 2742456455231 |
9 | 638843068227 |
10 | 202211220121 |
11 | 78836a64649 |
12 | 33234166021 |
13 | 160b747b851 |
14 | 9b03a3d881 |
15 | 53d765a8d1 |
hex | 2f14ba5a99 |
202211220121 has 2 divisors, whose sum is σ = 202211220122. Its totient is φ = 202211220120.
The previous prime is 202211220091. The next prime is 202211220151. The reversal of 202211220121 is 121022112202.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (202211220091) and next prime (202211220151).
It can be written as a sum of positive squares in only one way, i.e., 168662169225 + 33549050896 = 410685^2 + 183164^2 .
It is a cyclic number.
It is not a de Polignac number, because 202211220121 - 25 = 202211220089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202211220095 and 202211220104.
It is not a weakly prime, because it can be changed into another prime (202211220151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101105610060 + 101105610061.
It is an arithmetic number, because the mean of its divisors is an integer number (101105610061).
Almost surely, 2202211220121 is an apocalyptic number.
It is an amenable number.
202211220121 is a deficient number, since it is larger than the sum of its proper divisors (1).
202211220121 is an equidigital number, since it uses as much as digits as its factorization.
202211220121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 202211220121 its reverse (121022112202), we get a palindrome (323233332323).
The spelling of 202211220121 in words is "two hundred two billion, two hundred eleven million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •