Base | Representation |
---|---|
bin | 1010000110001110001101… |
… | …0111100101000101101000 |
3 | 1110022100020011122210021210 |
4 | 2201203203113211011220 |
5 | 2423343404041231440 |
6 | 35340105410033120 |
7 | 2224044105560010 |
oct | 241434327450550 |
9 | 43270204583253 |
10 | 11102010102120 |
11 | 35a0377301533 |
12 | 12b37888787a0 |
13 | 626bb8507022 |
14 | 2a54a9560c40 |
15 | 143bc70eea80 |
hex | a18e35e5168 |
11102010102120 has 128 divisors (see below), whose sum is σ = 38065212368640. Its totient is φ = 2537523793920.
The previous prime is 11102010102109. The next prime is 11102010102167. The reversal of 11102010102120 is 2120101020111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11102010102096 and 11102010102105.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29533264 + ... + 29906816.
It is an arithmetic number, because the mean of its divisors is an integer number (297384471630).
Almost surely, 211102010102120 is an apocalyptic number.
11102010102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102010102120 is an abundant number, since it is smaller than the sum of its proper divisors (26963202266520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102010102120 is a wasteful number, since it uses less digits than its factorization.
11102010102120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 408955 (or 408951 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11102010102120 its reverse (2120101020111), we get a palindrome (13222111122231).
The spelling of 11102010102120 in words is "eleven trillion, one hundred two billion, ten million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •