Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1001110010010110011110 |
3 | 1110101001201101101022201112 |
4 | 2201310110321302112132 |
5 | 2424142300340201420 |
6 | 35352244522342022 |
7 | 2225252326062560 |
oct | 241642471622636 |
9 | 43331641338645 |
10 | 11120021022110 |
11 | 35a7a79a72280 |
12 | 12b717465a912 |
13 | 6287c8a8bb30 |
14 | 2a62d75d1330 |
15 | 1443cd4138c5 |
hex | a1d14e7259e |
11120021022110 has 128 divisors (see below), whose sum is σ = 26880700621824. Its totient is φ = 3198649973760.
The previous prime is 11120021022109. The next prime is 11120021022151. The reversal of 11120021022110 is 1122012002111.
11120021022110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 45393314 + ... + 45637626.
It is an arithmetic number, because the mean of its divisors is an integer number (210005473608).
Almost surely, 211120021022110 is an apocalyptic number.
11120021022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11120021022110 is an abundant number, since it is smaller than the sum of its proper divisors (15760679599714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120021022110 is a wasteful number, since it uses less digits than its factorization.
11120021022110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 248898.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11120021022110 its reverse (1122012002111), we get a palindrome (12242033024221).
The spelling of 11120021022110 in words is "eleven trillion, one hundred twenty billion, twenty-one million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •