Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0001111111101110111 |
3 | 101112012001121120112200 |
4 | 1212202132033331313 |
5 | 3300441101133421 |
6 | 122325041315543 |
7 | 10645244511123 |
oct | 1464236177567 |
9 | 345161546480 |
10 | 110100021111 |
11 | 42769656493 |
12 | 19408335bb3 |
13 | a4c814a1b2 |
14 | 54865bc583 |
15 | 2ce5ca3726 |
hex | 19a278ff77 |
110100021111 has 12 divisors (see below), whose sum is σ = 159952634088. Its totient is φ = 72975735504.
The previous prime is 110100021089. The next prime is 110100021167. The reversal of 110100021111 is 111120001011.
It is not a de Polignac number, because 110100021111 - 210 = 110100020087 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 = 110100021093 and 110100021102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100021191) 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, 35354905 + ... + 35358018.
It is an arithmetic number, because the mean of its divisors is an integer number (13329386174).
Almost surely, 2110100021111 is an apocalyptic number.
110100021111 is a deficient number, since it is larger than the sum of its proper divisors (49852612977).
110100021111 is a wasteful number, since it uses less digits than its factorization.
110100021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70713102 (or 70713099 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110100021111 its reverse (111120001011), we get a palindrome (221220022122).
The spelling of 110100021111 in words is "one hundred ten billion, one hundred million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •