Base | Representation |
---|---|
bin | 101101110100… |
… | …110100000000 |
3 | 211121022110112 |
4 | 231310310000 |
5 | 11033402200 |
6 | 1105250452 |
7 | 204051512 |
oct | 55646400 |
9 | 24538415 |
10 | 12012800 |
11 | 6865438 |
12 | 4033a28 |
13 | 2647a87 |
14 | 1849bb2 |
15 | 10c4535 |
hex | b74d00 |
12012800 has 54 divisors (see below), whose sum is σ = 29749398. Its totient is φ = 4802560.
The previous prime is 12012743. The next prime is 12012809. The reversal of 12012800 is 821021.
It can be written as a sum of positive squares in 3 ways, for example, as 1149184 + 10863616 = 1072^2 + 3296^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012809) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5462 + ... + 7338.
Almost surely, 212012800 is an apocalyptic number.
12012800 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 12012800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14874699).
12012800 is an abundant number, since it is smaller than the sum of its proper divisors (17736598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012800 is an equidigital number, since it uses as much as digits as its factorization.
12012800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903 (or 1884 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 12012800 is about 3465.9486435895. The cubic root of 12012800 is about 229.0242214866.
Adding to 12012800 its reverse (821021), we get a palindrome (12833821).
The spelling of 12012800 in words is "twelve million, twelve thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •