Base | Representation |
---|---|
bin | 101010000001… |
… | …000000111000 |
3 | 202201120122100 |
4 | 222001000320 |
5 | 10304423300 |
6 | 1032023400 |
7 | 162422241 |
oct | 52010070 |
9 | 22646570 |
10 | 11014200 |
11 | 624314a |
12 | 3831b60 |
13 | 23883a2 |
14 | 1669cc8 |
15 | e78700 |
hex | a81038 |
11014200 has 144 divisors (see below), whose sum is σ = 38446200. Its totient is φ = 2822400.
The previous prime is 11014189. The next prime is 11014231. The reversal of 11014200 is 241011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 52095 + ... + 52305.
Almost surely, 211014200 is an apocalyptic number.
11014200 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 11014200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19223100).
11014200 is an abundant number, since it is smaller than the sum of its proper divisors (27432000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11014200 is a wasteful number, since it uses less digits than its factorization.
11014200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262 (or 250 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 11014200 is about 3318.7648304753. The cubic root of 11014200 is about 222.4936664443.
Adding to 11014200 its reverse (241011), we get a palindrome (11255211).
The spelling of 11014200 in words is "eleven million, fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •