Base | Representation |
---|---|
bin | 101101001001… |
… | …110101000100 |
3 | 211021100221210 |
4 | 231021311010 |
5 | 11012233430 |
6 | 1101411420 |
7 | 202416306 |
oct | 55116504 |
9 | 24240853 |
10 | 11836740 |
11 | 6755133 |
12 | 3b69b70 |
13 | 25b58b6 |
14 | 1801976 |
15 | 108c2b0 |
hex | b49d44 |
11836740 has 24 divisors (see below), whose sum is σ = 33143040. Its totient is φ = 3156448.
The previous prime is 11836729. The next prime is 11836751. The reversal of 11836740 is 4763811.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11836729) and next prime (11836751).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 11836698 and 11836707.
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 7 ways as a sum of consecutive naturals, for example, 98580 + ... + 98699.
It is an arithmetic number, because the mean of its divisors is an integer number (1380960).
Almost surely, 211836740 is an apocalyptic number.
11836740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11836740 is an abundant number, since it is smaller than the sum of its proper divisors (21306300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11836740 is a wasteful number, since it uses less digits than its factorization.
11836740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197291 (or 197289 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 11836740 is about 3440.4563650772. The cubic root of 11836740 is about 227.8998482882.
The spelling of 11836740 in words is "eleven million, eight hundred thirty-six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •