| Base | Representation |
|---|---|
| bin | 10100011111010100… |
| … | …11011101101000000 |
| 3 | 1001101121211001120211 |
| 4 | 22033222123231000 |
| 5 | 140012022400000 |
| 6 | 5015312243504 |
| 7 | 536411104636 |
| oct | 121752335500 |
| 9 | 31347731524 |
| 10 | 11000200000 |
| 11 | 4735365089 |
| 12 | 216bb40594 |
| 13 | 1063c976aa |
| 14 | 764d23356 |
| 15 | 445acd7ba |
| hex | 28fa9bb40 |
11000200000 has 84 divisors (see below), whose sum is σ = 27284402124. Its totient is φ = 4400000000.
The previous prime is 11000199827. The next prime is 11000200007. The reversal of 11000200000 is 200011.
11000200000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 10887670336 + 112529664 = 104344^2 + 10608^2 .
It is a Harshad number since it is a multiple of its sum of digits (4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000200007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 172500 + ... + 227500.
It is an arithmetic number, because the mean of its divisors is an integer number (324814311).
Almost surely, 211000200000 is an apocalyptic number.
11000200000 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 11000200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13642201062).
11000200000 is an abundant number, since it is smaller than the sum of its proper divisors (16284202124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000200000 is an frugal number, since it uses more digits than its factorization.
11000200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55038 (or 55008 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
Adding to 11000200000 its reverse (200011), we get a palindrome (11000400011).
The spelling of 11000200000 in words is "eleven billion, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •