Base | Representation |
---|---|
bin | 101010010101… |
… | …101101111000 |
3 | 202212212222002 |
4 | 222111231320 |
5 | 10320132000 |
6 | 1033520132 |
7 | 163224413 |
oct | 52255570 |
9 | 22785862 |
10 | 11099000 |
11 | 62a0930 |
12 | 3873048 |
13 | 23b7b73 |
14 | 168cb7a |
15 | e938d5 |
hex | a95b78 |
11099000 has 64 divisors (see below), whose sum is σ = 28360800. Its totient is φ = 4032000.
The previous prime is 11098999. The next prime is 11099027. The reversal of 11099000 is 99011.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10496 + ... + 11504.
Almost surely, 211099000 is an apocalyptic number.
11099000 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 11099000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14180400).
11099000 is an abundant number, since it is smaller than the sum of its proper divisors (17261800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11099000 is a wasteful number, since it uses less digits than its factorization.
11099000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041 (or 1027 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 20.
The square root of 11099000 is about 3331.5161713550. The cubic root of 11099000 is about 223.0632114503.
It can be divided in two parts, 110 and 99000, that multiplied together give a square (10890000 = 33002).
The spelling of 11099000 in words is "eleven million, ninety-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •