Base | Representation |
---|---|
bin | 110011010100110100… |
… | …0110001111010101001 |
3 | 101112111102210102022221 |
4 | 1212221220301322221 |
5 | 3301212334101441 |
6 | 122345013514041 |
7 | 10651234300312 |
oct | 1465150617251 |
9 | 345442712287 |
10 | 110220222121 |
11 | 42820495269 |
12 | 19440642921 |
13 | a517014759 |
14 | 549854b609 |
15 | 2d015e88d1 |
hex | 19a9a31ea9 |
110220222121 has 2 divisors, whose sum is σ = 110220222122. Its totient is φ = 110220222120.
The previous prime is 110220222001. The next prime is 110220222139. The reversal of 110220222121 is 121222022011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73002095721 + 37218126400 = 270189^2 + 192920^2 .
It is a cyclic number.
It is not a de Polignac number, because 110220222121 - 217 = 110220091049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110220222095 and 110220222104.
It is not a weakly prime, because it can be changed into another prime (110220225121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110111060 + 55110111061.
It is an arithmetic number, because the mean of its divisors is an integer number (55110111061).
Almost surely, 2110220222121 is an apocalyptic number.
It is an amenable number.
110220222121 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220222121 is an equidigital number, since it uses as much as digits as its factorization.
110220222121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 110220222121 its reverse (121222022011), we get a palindrome (231442244132).
The spelling of 110220222121 in words is "one hundred ten billion, two hundred twenty million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •