Base | Representation |
---|---|
bin | 101101000111… |
… | …101100100000 |
3 | 211020220222002 |
4 | 231013230200 |
5 | 11011444000 |
6 | 1101303132 |
7 | 202351652 |
oct | 55075440 |
9 | 24226862 |
10 | 11828000 |
11 | 6749608 |
12 | 3b64aa8 |
13 | 25b1922 |
14 | 17dc6d2 |
15 | 10898d5 |
hex | b47b20 |
11828000 has 48 divisors (see below), whose sum is σ = 29071224. Its totient is φ = 4729600.
The previous prime is 11827999. The next prime is 11828017. The reversal of 11828000 is 82811.
It can be written as a sum of positive squares in 4 ways, for example, as 1817104 + 10010896 = 1348^2 + 3164^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 2522 + ... + 5478.
Almost surely, 211828000 is an apocalyptic number.
11828000 is a gapful number since it is divisible by the number (10) 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 11828000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14535612).
11828000 is an abundant number, since it is smaller than the sum of its proper divisors (17243224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11828000 is an equidigital number, since it uses as much as digits as its factorization.
11828000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2982 (or 2964 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 20.
The square root of 11828000 is about 3439.1859501923. The cubic root of 11828000 is about 227.8437423243.
The spelling of 11828000 in words is "eleven million, eight hundred twenty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •