Base | Representation |
---|---|
bin | 101010001110… |
… | …011011010000 |
3 | 202211101000000 |
4 | 222032123100 |
5 | 10313203021 |
6 | 1033130000 |
7 | 163041351 |
oct | 52163320 |
9 | 22741000 |
10 | 11069136 |
11 | 6280451 |
12 | 3859900 |
13 | 23a73b0 |
14 | 1681d28 |
15 | e89b26 |
hex | a8e6d0 |
11069136 has 140 divisors (see below), whose sum is σ = 35102788. Its totient is φ = 3359232.
The previous prime is 11069119. The next prime is 11069147. The reversal of 11069136 is 63196011.
It can be written as a sum of positive squares in 2 ways, for example, as 3779136 + 7290000 = 1944^2 + 2700^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
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 27 ways as a sum of consecutive naturals, for example, 151596 + ... + 151668.
Almost surely, 211069136 is an apocalyptic number.
11069136 is a gapful number since it is divisible by the number (16) 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 11069136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17551394).
11069136 is an abundant number, since it is smaller than the sum of its proper divisors (24033652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11069136 is an equidigital number, since it uses as much as digits as its factorization.
11069136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The square root of 11069136 is about 3327.0311089619. The cubic root of 11069136 is about 222.8629668808.
The spelling of 11069136 in words is "eleven million, sixty-nine thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •