Base | Representation |
---|---|
bin | 110011001110010100… |
… | …0010101100010111111 |
3 | 101111221020011200202100 |
4 | 1212130220111202333 |
5 | 3300241003031421 |
6 | 122311220400143 |
7 | 10642644406341 |
oct | 1463450254277 |
9 | 344836150670 |
10 | 110002002111 |
11 | 42719298351 |
12 | 1939b546053 |
13 | a4b0a4b2a1 |
14 | 5477585291 |
15 | 2cdc390c26 |
hex | 199ca158bf |
110002002111 has 12 divisors (see below), whose sum is σ = 164017322560. Its totient is φ = 70969033440.
The previous prime is 110002002107. The next prime is 110002002113. The reversal of 110002002111 is 111200200011.
It is a happy number.
It is not a de Polignac number, because 110002002111 - 22 = 110002002107 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 = 110002002093 and 110002002102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002002113) 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, 197135926 + ... + 197136483.
Almost surely, 2110002002111 is an apocalyptic number.
110002002111 is a deficient number, since it is larger than the sum of its proper divisors (54015320449).
110002002111 is a wasteful number, since it uses less digits than its factorization.
110002002111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 394272446 (or 394272443 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110002002111 its reverse (111200200011), we get a palindrome (221202202122).
The spelling of 110002002111 in words is "one hundred ten billion, two million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •