Base | Representation |
---|---|
bin | 10100101111001010… |
… | …00110100000101000 |
3 | 1001201212202000122111 |
4 | 22113211012200220 |
5 | 140300023121300 |
6 | 5040415132104 |
7 | 542613052561 |
oct | 122745064050 |
9 | 31655660574 |
10 | 11133020200 |
11 | 47a3332945 |
12 | 21a8514034 |
13 | 108565ca23 |
14 | 778819168 |
15 | 4525b79ba |
hex | 297946828 |
11133020200 has 96 divisors (see below), whose sum is σ = 26201894400. Its totient is φ = 4398831360.
The previous prime is 11133020191. The next prime is 11133020201. The reversal of 11133020200 is 202033111.
It is not an unprimeable number, because it can be changed into a prime (11133020201) 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, 10092849 + ... + 10093951.
It is an arithmetic number, because the mean of its divisors is an integer number (272936400).
Almost surely, 211133020200 is an apocalyptic number.
11133020200 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 11133020200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13100947200).
11133020200 is an abundant number, since it is smaller than the sum of its proper divisors (15068874200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11133020200 is a wasteful number, since it uses less digits than its factorization.
11133020200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1691 (or 1682 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 11133020200 its reverse (202033111), we get a palindrome (11335053311).
The spelling of 11133020200 in words is "eleven billion, one hundred thirty-three million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •