| Base | Representation |
|---|---|
| bin | 10100100001101100… |
| … | …00010100100100000 |
| 3 | 1001110000010000111220 |
| 4 | 22100312002210200 |
| 5 | 140032111120000 |
| 6 | 5021301135040 |
| 7 | 540041424123 |
| oct | 122066024440 |
| 9 | 31400100456 |
| 10 | 11020020000 |
| 11 | 4745572150 |
| 12 | 21766ba480 |
| 13 | 1068116bc2 |
| 14 | 7678023ba |
| 15 | 4476e61a0 |
| hex | 290d82920 |
11020020000 has 480 divisors, whose sum is σ = 40244117760. Its totient is φ = 2616960000.
The previous prime is 11020019999. The next prime is 11020020001. The reversal of 11020020000 is 2002011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11020019999) and next prime (11020020001).
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is not an unprimeable number, because it can be changed into a prime (11020020001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 38939859 + ... + 38940141.
It is an arithmetic number, because the mean of its divisors is an integer number (83841912).
Almost surely, 211020020000 is an apocalyptic number.
11020020000 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 11020020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20122058880).
11020020000 is an abundant number, since it is smaller than the sum of its proper divisors (29224097760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020020000 is a wasteful number, since it uses less digits than its factorization.
11020020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386 (or 363 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 11020020000 its reverse (2002011), we get a palindrome (11022022011).
The spelling of 11020020000 in words is "eleven billion, twenty million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •