Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1110101010011001111 |
3 | 101111222111110021011002 |
4 | 1212131231311103033 |
5 | 3300310134020421 |
6 | 122313111050515 |
7 | 10643255304134 |
oct | 1463555652317 |
9 | 344874407132 |
10 | 110020220111 |
11 | 4272860084a |
12 | 193a5670a3b |
13 | a4b4759579 |
14 | 5479b6858b |
15 | 2cddc8db0b |
hex | 199db754cf |
110020220111 has 8 divisors (see below), whose sum is σ = 111222072000. Its totient is φ = 108824548000.
The previous prime is 110020220099. The next prime is 110020220117. The reversal of 110020220111 is 111022020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110020220111 - 210 = 110020219087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110020220092 and 110020220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020220117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1509140 + ... + 1580361.
It is an arithmetic number, because the mean of its divisors is an integer number (13902759000).
Almost surely, 2110020220111 is an apocalyptic number.
110020220111 is a deficient number, since it is larger than the sum of its proper divisors (1201851889).
110020220111 is a wasteful number, since it uses less digits than its factorization.
110020220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3089889.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110020220111 its reverse (111022020011), we get a palindrome (221042240122).
The spelling of 110020220111 in words is "one hundred ten billion, twenty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •