Base | Representation |
---|---|
bin | 110011010001010010… |
… | …1110101100011111111 |
3 | 101112012012100121221100 |
4 | 1212202211311203333 |
5 | 3300442103310421 |
6 | 122325152104143 |
7 | 10645300434012 |
oct | 1464245654377 |
9 | 345165317840 |
10 | 110102010111 |
11 | 4276a794895 |
12 | 19408b35053 |
13 | a4c8695612 |
14 | 5486979379 |
15 | 2ce6047c26 |
hex | 19a29758ff |
110102010111 has 24 divisors (see below), whose sum is σ = 163802693600. Its totient is φ = 71212810176.
The previous prime is 110102010107. The next prime is 110102010163. The reversal of 110102010111 is 111010201011.
It is not a de Polignac number, because 110102010111 - 22 = 110102010107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110102010093 and 110102010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102010311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 357475 + ... + 589908.
Almost surely, 2110102010111 is an apocalyptic number.
110102010111 is a deficient number, since it is larger than the sum of its proper divisors (53700683489).
110102010111 is a wasteful number, since it uses less digits than its factorization.
110102010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 947775 (or 947772 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110102010111 its reverse (111010201011), we get a palindrome (221112211122).
The spelling of 110102010111 in words is "one hundred ten billion, one hundred two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •