Base | Representation |
---|---|
bin | 10100111100001011… |
… | …01000011110000000 |
3 | 1002000111012111112121 |
4 | 22132011220132000 |
5 | 141011001224300 |
6 | 5055315334024 |
7 | 545410134643 |
oct | 123605503600 |
9 | 32014174477 |
10 | 11242211200 |
11 | 4849a31740 |
12 | 2218bb1314 |
13 | 10a2170a9c |
14 | 78911da5a |
15 | 45be8581a |
hex | 29e168780 |
11242211200 has 192 divisors, whose sum is σ = 30432226320. Its totient is φ = 4069785600.
The previous prime is 11242211161. The next prime is 11242211203. The reversal of 11242211200 is 211224211.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11242211203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9749824 + ... + 9750976.
Almost surely, 211242211200 is an apocalyptic number.
11242211200 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 11242211200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15216113160).
11242211200 is an abundant number, since it is smaller than the sum of its proper divisors (19190015120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11242211200 is a wasteful number, since it uses less digits than its factorization.
11242211200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1465 (or 1448 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11242211200 its reverse (211224211), we get a palindrome (11453435411).
The spelling of 11242211200 in words is "eleven billion, two hundred forty-two million, two hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •