Base | Representation |
---|---|
bin | 101101110010… |
… | …011001010100 |
3 | 211120210212212 |
4 | 231302121110 |
5 | 11033043100 |
6 | 1105132552 |
7 | 204010610 |
oct | 55623124 |
9 | 24523785 |
10 | 12002900 |
11 | 6858a58 |
12 | 402a158 |
13 | 2643410 |
14 | 1846340 |
15 | 10c1635 |
hex | b72654 |
12002900 has 72 divisors (see below), whose sum is σ = 32081280. Its totient is φ = 3795840.
The previous prime is 12002869. The next prime is 12002917. The reversal of 12002900 is 920021.
12002900 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8441 + ... + 9759.
Almost surely, 212002900 is an apocalyptic number.
12002900 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 12002900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16040640).
12002900 is an abundant number, since it is smaller than the sum of its proper divisors (20078380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002900 is a wasteful number, since it uses less digits than its factorization.
12002900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1353 (or 1346 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 12002900 is about 3464.5201687968. The cubic root of 12002900 is about 228.9612896436.
Adding to 12002900 its reverse (920021), we get a palindrome (12922921).
The spelling of 12002900 in words is "twelve million, two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •