Base | Representation |
---|---|
bin | 101010001111… |
… | …011001111110 |
3 | 202211120111200 |
4 | 222033121332 |
5 | 10313320100 |
6 | 1033200330 |
7 | 163056144 |
oct | 52173176 |
9 | 22746450 |
10 | 11073150 |
11 | 6283470 |
12 | 38600a6 |
13 | 23a917a |
14 | 1683594 |
15 | e8ae00 |
hex | a8f67e |
11073150 has 72 divisors (see below), whose sum is σ = 32468904. Its totient is φ = 2683200.
The previous prime is 11073149. The next prime is 11073163. The reversal of 11073150 is 5137011.
It is a happy number.
It is a super-2 number, since 2×110731502 = 245229301845000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 3832 + ... + 6068.
It is an arithmetic number, because the mean of its divisors is an integer number (450957).
Almost surely, 211073150 is an apocalyptic number.
11073150 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 11073150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16234452).
11073150 is an abundant number, since it is smaller than the sum of its proper divisors (21395754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11073150 is a wasteful number, since it uses less digits than its factorization.
11073150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2266 (or 2258 counting only the distinct ones).
The product of its (nonzero) digits is 105, while the sum is 18.
The square root of 11073150 is about 3327.6342948107. The cubic root of 11073150 is about 222.8899025524.
The spelling of 11073150 in words is "eleven million, seventy-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •