Base | Representation |
---|---|
bin | 10100101101101000… |
… | …10100011101101100 |
3 | 1001200222200022221120 |
4 | 22112310110131230 |
5 | 140233234413200 |
6 | 5035241100540 |
7 | 542366262222 |
oct | 122664243554 |
9 | 31628608846 |
10 | 11120232300 |
11 | 4797099131 |
12 | 21a4187750 |
13 | 1082b03218 |
14 | 776c4ab12 |
15 | 4513dd9a0 |
hex | 296d1476c |
11120232300 has 36 divisors (see below), whose sum is σ = 32174539656. Its totient is φ = 2965395200.
The previous prime is 11120232283. The next prime is 11120232371. The reversal of 11120232300 is 323202111.
11120232300 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 (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11120232300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18533421 + ... + 18534020.
Almost surely, 211120232300 is an apocalyptic number.
11120232300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120232300 is an abundant number, since it is smaller than the sum of its proper divisors (21054307356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120232300 is a wasteful number, since it uses less digits than its factorization.
11120232300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37067458 (or 37067451 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11120232300 its reverse (323202111), we get a palindrome (11443434411).
The spelling of 11120232300 in words is "eleven billion, one hundred twenty million, two hundred thirty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •