Base | Representation |
---|---|
bin | 10101000101111110… |
… | …01101000100101000 |
3 | 1002020012212202010002 |
4 | 22202333031010220 |
5 | 141143022142300 |
6 | 5111413242132 |
7 | 550425626003 |
oct | 124277150450 |
9 | 32205782102 |
10 | 11324412200 |
11 | 4891376552 |
12 | 2240633348 |
13 | 10b61c1c2a |
14 | 795dda53a |
15 | 4642c15d5 |
hex | 2a2fcd128 |
11324412200 has 96 divisors (see below), whose sum is σ = 26674959360. Its totient is φ = 4470681600.
The previous prime is 11324412199. The next prime is 11324412221. The reversal of 11324412200 is 221442311.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 5358344 + ... + 5360456.
It is an arithmetic number, because the mean of its divisors is an integer number (277864160).
Almost surely, 211324412200 is an apocalyptic number.
11324412200 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 11324412200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13337479680).
11324412200 is an abundant number, since it is smaller than the sum of its proper divisors (15350547160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11324412200 is a wasteful number, since it uses less digits than its factorization.
11324412200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2467 (or 2458 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 11324412200 its reverse (221442311), we get a palindrome (11545854511).
The spelling of 11324412200 in words is "eleven billion, three hundred twenty-four million, four hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •