Base | Representation |
---|---|
bin | 10100100000110000… |
… | …10101011111110000 |
3 | 1001102110110102000220 |
4 | 22100120111133300 |
5 | 140023112430300 |
6 | 5020422213040 |
7 | 536615303103 |
oct | 122030253760 |
9 | 31373412026 |
10 | 11012233200 |
11 | 4741133881 |
12 | 2173b84180 |
13 | 106661b827 |
14 | 76677673a |
15 | 446ba8da0 |
hex | 2906157f0 |
11012233200 has 60 divisors (see below), whose sum is σ = 35275857528. Its totient is φ = 2936595200.
The previous prime is 11012233187. The next prime is 11012233213. The reversal of 11012233200 is 233221011.
It is an interprime number because it is at equal distance from previous prime (11012233187) and next prime (11012233213).
It is a tau number, because it is divible by the number of its divisors (60).
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 11012233200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4587231 + ... + 4589630.
Almost surely, 211012233200 is an apocalyptic number.
11012233200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11012233200 is an abundant number, since it is smaller than the sum of its proper divisors (24263624328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012233200 is a wasteful number, since it uses less digits than its factorization.
11012233200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9176882 (or 9176871 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11012233200 its reverse (233221011), we get a palindrome (11245454211).
The spelling of 11012233200 in words is "eleven billion, twelve million, two hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •