Base | Representation |
---|---|
bin | 10100101101101001… |
… | …00111111110001000 |
3 | 1001200222211101112211 |
4 | 22112310213332020 |
5 | 140233244442300 |
6 | 5035242514504 |
7 | 542400044164 |
oct | 122664477610 |
9 | 31628741484 |
10 | 11120312200 |
11 | 4797143168 |
12 | 21a4205a34 |
13 | 1082b306ba |
14 | 776c6bca4 |
15 | 4514074ba |
hex | 296d27f88 |
11120312200 has 96 divisors (see below), whose sum is σ = 26362152000. Its totient is φ = 4361299200.
The previous prime is 11120312197. The next prime is 11120312213. The reversal of 11120312200 is 221302111.
It is a super-2 number, since 2×111203122002 (a number of 21 digits) contains 22 as substring.
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, 4378531 + ... + 4381069.
It is an arithmetic number, because the mean of its divisors is an integer number (274605750).
Almost surely, 211120312200 is an apocalyptic number.
11120312200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11120312200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13181076000).
11120312200 is an abundant number, since it is smaller than the sum of its proper divisors (15241839800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120312200 is a wasteful number, since it uses less digits than its factorization.
11120312200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2975 (or 2966 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11120312200 its reverse (221302111), we get a palindrome (11341614311).
The spelling of 11120312200 in words is "eleven billion, one hundred twenty million, three hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •