Base | Representation |
---|---|
bin | 110011010100001110… |
… | …0011110100101110101 |
3 | 101112110001011012121102 |
4 | 1212220130132211311 |
5 | 3301142224020041 |
6 | 122343021055445 |
7 | 10650602262203 |
oct | 1465034364565 |
9 | 345401135542 |
10 | 110200220021 |
11 | 42810173401 |
12 | 194359b7585 |
13 | a512b303a8 |
14 | 5495a22073 |
15 | 2cee99709b |
hex | 19a871e975 |
110200220021 has 2 divisors, whose sum is σ = 110200220022. Its totient is φ = 110200220020.
The previous prime is 110200219981. The next prime is 110200220027. The reversal of 110200220021 is 120022002011.
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., 88336161796 + 21864058225 = 297214^2 + 147865^2 .
It is a cyclic number.
It is not a de Polignac number, because 110200220021 - 226 = 110133111157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110200219984 and 110200220011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110200220027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100110010 + 55100110011.
It is an arithmetic number, because the mean of its divisors is an integer number (55100110011).
Almost surely, 2110200220021 is an apocalyptic number.
It is an amenable number.
110200220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
110200220021 is an equidigital number, since it uses as much as digits as its factorization.
110200220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 110200220021 its reverse (120022002011), we get a palindrome (230222222032).
The spelling of 110200220021 in words is "one hundred ten billion, two hundred million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •