Base | Representation |
---|---|
bin | 10100101110010100… |
… | …11100011101001000 |
3 | 1001201101120222220200 |
4 | 22113022130131020 |
5 | 140241231012300 |
6 | 5040005252200 |
7 | 542466466443 |
oct | 122712343510 |
9 | 31641528820 |
10 | 11126032200 |
11 | 479a39a738 |
12 | 21a6104060 |
13 | 108408410a |
14 | 77791a65a |
15 | 451b87200 |
hex | 29729c748 |
11126032200 has 144 divisors (see below), whose sum is σ = 37877220420. Its totient is φ = 2926264320.
The previous prime is 11126032187. The next prime is 11126032241. The reversal of 11126032200 is 223062111.
It can be written as a sum of positive squares in 6 ways, for example, as 6874731396 + 4251300804 = 82914^2 + 65202^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 89064 + ... + 173736.
Almost surely, 211126032200 is an apocalyptic number.
11126032200 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 11126032200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18938610210).
11126032200 is an abundant number, since it is smaller than the sum of its proper divisors (26751188220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11126032200 is a wasteful number, since it uses less digits than its factorization.
11126032200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84768 (or 84756 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11126032200 its reverse (223062111), we get a palindrome (11349094311).
The spelling of 11126032200 in words is "eleven billion, one hundred twenty-six million, thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •