Base | Representation |
---|---|
bin | 101010001000… |
… | …000000100010 |
3 | 202210000221110 |
4 | 222020000202 |
5 | 10311332400 |
6 | 1032404150 |
7 | 162601620 |
oct | 52100042 |
9 | 22700843 |
10 | 11042850 |
11 | 6262725 |
12 | 3846656 |
13 | 2398440 |
14 | 1676510 |
15 | e81e50 |
hex | a88022 |
11042850 has 96 divisors (see below), whose sum is σ = 33747840. Its totient is φ = 2327040.
The previous prime is 11042849. The next prime is 11042887. The reversal of 11042850 is 5824011.
It is a super-2 number, since 2×110428502 = 243889072245000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13246 + ... + 14054.
It is an arithmetic number, because the mean of its divisors is an integer number (351540).
Almost surely, 211042850 is an apocalyptic number.
11042850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11042850, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16873920).
11042850 is an abundant number, since it is smaller than the sum of its proper divisors (22704990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11042850 is a wasteful number, since it uses less digits than its factorization.
11042850 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 844 (or 839 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
The square root of 11042850 is about 3323.0783920937. The cubic root of 11042850 is about 222.6864153344.
Adding to 11042850 its reverse (5824011), we get a palindrome (16866861).
The spelling of 11042850 in words is "eleven million, forty-two thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •