Base | Representation |
---|---|
bin | 10100110111001010… |
… | …11111001001110000 |
3 | 1001220120012122011100 |
4 | 22123211133021300 |
5 | 140414224330000 |
6 | 5051215444400 |
7 | 544360245531 |
oct | 123345371160 |
9 | 31816178140 |
10 | 11200230000 |
11 | 4828268633 |
12 | 2206b26700 |
13 | 109656253b |
14 | 783712688 |
15 | 458441a00 |
hex | 29b95f270 |
11200230000 has 150 divisors (see below), whose sum is σ = 39169136864. Its totient is φ = 2986704000.
The previous prime is 11200229987. The next prime is 11200230031. The reversal of 11200230000 is 3200211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (150).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 27777 + ... + 152223.
Almost surely, 211200230000 is an apocalyptic number.
11200230000 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 11200230000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19584568432).
11200230000 is an abundant number, since it is smaller than the sum of its proper divisors (27968906864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200230000 is a wasteful number, since it uses less digits than its factorization.
11200230000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124481 (or 124457 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 11200230000 its reverse (3200211), we get a palindrome (11203430211).
The spelling of 11200230000 in words is "eleven billion, two hundred million, two hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •