Base | Representation |
---|---|
bin | 101010010001… |
… | …100101110000 |
3 | 202212000210000 |
4 | 222101211300 |
5 | 10314111341 |
6 | 1033310000 |
7 | 163124214 |
oct | 52214560 |
9 | 22760700 |
10 | 11082096 |
11 | 628a163 |
12 | 3865300 |
13 | 23b026c |
14 | 1686944 |
15 | e8d8b6 |
hex | a91970 |
11082096 has 100 divisors (see below), whose sum is σ = 34029072. Its totient is φ = 3469824.
The previous prime is 11082091. The next prime is 11082101. The reversal of 11082096 is 69028011.
It is an interprime number because it is at equal distance from previous prime (11082091) and next prime (11082101).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11082091) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 21781 + ... + 22283.
Almost surely, 211082096 is an apocalyptic number.
11082096 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 11082096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17014536).
11082096 is an abundant number, since it is smaller than the sum of its proper divisors (22946976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11082096 is a wasteful number, since it uses less digits than its factorization.
11082096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 540 (or 525 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The square root of 11082096 is about 3328.9782216170. The cubic root of 11082096 is about 222.9499106601.
The spelling of 11082096 in words is "eleven million, eighty-two thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •