Base | Representation |
---|---|
bin | 10000010100111100011… |
… | …010010101100001010110 |
3 | 10222021002002221121201200 |
4 | 100110330122111201112 |
5 | 121340324000013420 |
6 | 2215234545533330 |
7 | 144030130436322 |
oct | 20247432254126 |
9 | 3867062847650 |
10 | 1122000001110 |
11 | 3a292382849a |
12 | 16154b644246 |
13 | 81a5b92a901 |
14 | 3c43b248982 |
15 | 1e2bc0ceb90 |
hex | 1053c695856 |
1122000001110 has 48 divisors (see below), whose sum is σ = 2938493465856. Its totient is φ = 297016055424.
The previous prime is 1122000001069. The next prime is 1122000001159. The reversal of 1122000001110 is 111000002211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1122000001092 and 1122000001101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45486454 + ... + 45511113.
It is an arithmetic number, because the mean of its divisors is an integer number (61218613872).
Almost surely, 21122000001110 is an apocalyptic number.
1122000001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1122000001110 is an abundant number, since it is smaller than the sum of its proper divisors (1816493464746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122000001110 is a wasteful number, since it uses less digits than its factorization.
1122000001110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90997717 (or 90997714 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1122000001110 its reverse (111000002211), we get a palindrome (1233000003321).
The spelling of 1122000001110 in words is "one trillion, one hundred twenty-two billion, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •