Base | Representation |
---|---|
bin | 101010000100… |
… | …110111110000 |
3 | 202202101022112 |
4 | 222010313300 |
5 | 10310430000 |
6 | 1032224452 |
7 | 162516302 |
oct | 52046760 |
9 | 22671275 |
10 | 11030000 |
11 | 6254003 |
12 | 383b128 |
13 | 2392637 |
14 | 1671972 |
15 | e7d235 |
hex | a84df0 |
11030000 has 50 divisors (see below), whose sum is σ = 26728944. Its totient is φ = 4408000.
The previous prime is 11029999. The next prime is 11030011. The reversal of 11030000 is 3011.
It is a tau number, because it is divible by the number of its divisors (50).
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 9449 + ... + 10551.
Almost surely, 211030000 is an apocalyptic number.
11030000 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 11030000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13364472).
11030000 is an abundant number, since it is smaller than the sum of its proper divisors (15698944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11030000 is an equidigital number, since it uses as much as digits as its factorization.
11030000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1131 (or 1110 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 5.
The square root of 11030000 is about 3321.1443810831. The cubic root of 11030000 is about 222.6000055431.
Adding to 11030000 its reverse (3011), we get a palindrome (11033011).
The spelling of 11030000 in words is "eleven million, thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •