Base | Representation |
---|---|
bin | 10000001010110011010… |
… | …100010010000111100010 |
3 | 10221012222011111022010210 |
4 | 100022303110102013202 |
5 | 121201023130013442 |
6 | 2210234211234550 |
7 | 143163225115242 |
oct | 20126324220742 |
9 | 3835864438123 |
10 | 1111110001122 |
11 | 3992456a1300 |
12 | 15b4105a8a56 |
13 | 80a14738634 |
14 | 3bac6c0db22 |
15 | 1dd8101d19c |
hex | 102b35121e2 |
1111110001122 has 48 divisors (see below), whose sum is σ = 2444976265536. Its totient is φ = 336373197600.
The previous prime is 1111110001097. The next prime is 1111110001139. The reversal of 1111110001122 is 2211000111111.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 1111110001098 and 1111110001107.
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, 6288 + ... + 1490724.
It is an arithmetic number, because the mean of its divisors is an integer number (50937005532).
Almost surely, 21111110001122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1111110001122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1222488132768).
1111110001122 is an abundant number, since it is smaller than the sum of its proper divisors (1333866264414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111110001122 is a wasteful number, since it uses less digits than its factorization.
1111110001122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1485495 (or 1485484 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1111110001122 its reverse (2211000111111), we get a palindrome (3322110112233).
The spelling of 1111110001122 in words is "one trillion, one hundred eleven billion, one hundred ten million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •