Base | Representation |
---|---|
bin | 10100101100011011… |
… | …10000001010001000 |
3 | 1001200021122200101110 |
4 | 22112031300022020 |
5 | 140223142401440 |
6 | 5034240250320 |
7 | 542214323406 |
oct | 122615601210 |
9 | 31607580343 |
10 | 11110122120 |
11 | 4791413209 |
12 | 21a09109a0 |
13 | 10809a3476 |
14 | 775778476 |
15 | 450593080 |
hex | 296370288 |
11110122120 has 32 divisors (see below), whose sum is σ = 33330366720. Its totient is φ = 2962699200.
The previous prime is 11110122043. The next prime is 11110122131. The reversal of 11110122120 is 2122101111.
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 = 11110122096 and 11110122105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46292056 + ... + 46292295.
It is an arithmetic number, because the mean of its divisors is an integer number (1041573960).
Almost surely, 211110122120 is an apocalyptic number.
11110122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110122120 is an abundant number, since it is smaller than the sum of its proper divisors (22220244600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110122120 is a wasteful number, since it uses less digits than its factorization.
11110122120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92584365 (or 92584361 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11110122120 its reverse (2122101111), we get a palindrome (13232223231).
The spelling of 11110122120 in words is "eleven billion, one hundred ten million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •