Base | Representation |
---|---|
bin | 10100110111001011… |
… | …10111110101011100 |
3 | 1001220120101202211210 |
4 | 22123211313311130 |
5 | 140414241043400 |
6 | 5051221544420 |
7 | 544361146350 |
oct | 123345676534 |
9 | 31816352753 |
10 | 11200331100 |
11 | 4828327592 |
12 | 2206b75110 |
13 | 109659956a |
14 | 78373b460 |
15 | 458461950 |
hex | 29b977d5c |
11200331100 has 144 divisors (see below), whose sum is σ = 37203396608. Its totient is φ = 2548488960.
The previous prime is 11200331039. The next prime is 11200331101. The reversal of 11200331100 is 113300211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200331101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 456342 + ... + 480258.
Almost surely, 211200331100 is an apocalyptic number.
11200331100 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 11200331100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18601698304).
11200331100 is an abundant number, since it is smaller than the sum of its proper divisors (26003065508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200331100 is a wasteful number, since it uses less digits than its factorization.
11200331100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24164 (or 24157 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 11200331100 its reverse (113300211), we get a palindrome (11313631311).
The spelling of 11200331100 in words is "eleven billion, two hundred million, three hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •