Base | Representation |
---|---|
bin | 10100101100011011… |
… | …01101101111011100 |
3 | 1001200021122011210210 |
4 | 22112031231233130 |
5 | 140223142042340 |
6 | 5034240132420 |
7 | 542214252504 |
oct | 122615555734 |
9 | 31607564723 |
10 | 11110112220 |
11 | 4791406829 |
12 | 21a0907110 |
13 | 108099bacc |
14 | 775774a04 |
15 | 450590180 |
hex | 29636dbdc |
11110112220 has 24 divisors (see below), whose sum is σ = 31108314384. Its totient is φ = 2962696576.
The previous prime is 11110112219. The next prime is 11110112243. The reversal of 11110112220 is 2221101111.
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 = 11110112196 and 11110112205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92584209 + ... + 92584328.
It is an arithmetic number, because the mean of its divisors is an integer number (1296179766).
Almost surely, 211110112220 is an apocalyptic number.
11110112220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110112220 is an abundant number, since it is smaller than the sum of its proper divisors (19998202164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110112220 is a wasteful number, since it uses less digits than its factorization.
11110112220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185168549 (or 185168547 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11110112220 its reverse (2221101111), we get a palindrome (13331213331).
It can be divided in two parts, 111101 and 12220, that added together give a palindrome (123321).
The spelling of 11110112220 in words is "eleven billion, one hundred ten million, one hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •