Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1000100011110001111 |
3 | 101111222111002002210200 |
4 | 1212131231010132033 |
5 | 3300310111120421 |
6 | 122313102504543 |
7 | 10643253512061 |
oct | 1463555043617 |
9 | 344874062720 |
10 | 110020020111 |
11 | 42728484561 |
12 | 193a5595153 |
13 | a4b46b9521 |
14 | 5479b15731 |
15 | 2cddc4e726 |
hex | 199db4478f |
110020020111 has 12 divisors (see below), whose sum is σ = 158937562992. Its totient is φ = 73337561856.
The previous prime is 110020020091. The next prime is 110020020133. The reversal of 110020020111 is 111020020011.
It is a happy number.
It is not a de Polignac number, because 110020020111 - 211 = 110020018063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110020020093 and 110020020102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020022111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 683026 + ... + 828591.
It is an arithmetic number, because the mean of its divisors is an integer number (13244796916).
Almost surely, 2110020020111 is an apocalyptic number.
110020020111 is a deficient number, since it is larger than the sum of its proper divisors (48917542881).
110020020111 is a wasteful number, since it uses less digits than its factorization.
110020020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519710 (or 1519707 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110020020111 its reverse (111020020011), we get a palindrome (221040040122).
The spelling of 110020020111 in words is "one hundred ten billion, twenty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •