Base | Representation |
---|---|
bin | 1101000111011… |
… | …00111000010001 |
3 | 21200000201000212 |
4 | 12203230320101 |
5 | 211131202121 |
6 | 14530053505 |
7 | 2504113214 |
oct | 643547021 |
9 | 250021025 |
10 | 110022161 |
11 | 57117307 |
12 | 30a1a295 |
13 | 19a42492 |
14 | 1087d77b |
15 | 99d425b |
hex | 68ece11 |
110022161 has 2 divisors, whose sum is σ = 110022162. Its totient is φ = 110022160.
The previous prime is 110022139. The next prime is 110022163. The reversal of 110022161 is 161220011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77986561 + 32035600 = 8831^2 + 5660^2 .
It is a cyclic number.
It is not a de Polignac number, because 110022161 - 210 = 110021137 is a prime.
It is a super-2 number, since 2×1100221612 = 24209751822219842, which contains 22 as substring.
Together with 110022163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110022163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55011080 + 55011081.
It is an arithmetic number, because the mean of its divisors is an integer number (55011081).
Almost surely, 2110022161 is an apocalyptic number.
It is an amenable number.
110022161 is a deficient number, since it is larger than the sum of its proper divisors (1).
110022161 is an equidigital number, since it uses as much as digits as its factorization.
110022161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 110022161 is about 10489.1449127181. The cubic root of 110022161 is about 479.1741601080.
Adding to 110022161 its reverse (161220011), we get a palindrome (271242172).
The spelling of 110022161 in words is "one hundred ten million, twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •