Base | Representation |
---|---|
bin | 101010000010… |
… | …011011100000 |
3 | 202201212121011 |
4 | 222002123200 |
5 | 10310120000 |
6 | 1032110304 |
7 | 162445165 |
oct | 52023340 |
9 | 22655534 |
10 | 11020000 |
11 | 6247542 |
12 | 3835394 |
13 | 238ac14 |
14 | 166c06c |
15 | e7a2ba |
hex | a826e0 |
11020000 has 120 divisors (see below), whose sum is σ = 29521800. Its totient is φ = 4032000.
The previous prime is 11019989. The next prime is 11020001. The reversal of 11020000 is 2011.
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 (11020001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 379986 + ... + 380014.
It is an arithmetic number, because the mean of its divisors is an integer number (246015).
Almost surely, 211020000 is an apocalyptic number.
11020000 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 11020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14760900).
11020000 is an abundant number, since it is smaller than the sum of its proper divisors (18501800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020000 is an equidigital number, since it uses as much as digits as its factorization.
11020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78 (or 55 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 4.
The square root of 11020000 is about 3319.6385345396. The cubic root of 11020000 is about 222.5327141226.
Adding to 11020000 its reverse (2011), we get a palindrome (11022011).
The spelling of 11020000 in words is "eleven million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •