Base | Representation |
---|---|
bin | 101110000010… |
… | …000011011000 |
3 | 211201001212010 |
4 | 232002003120 |
5 | 11042121112 |
6 | 1110345520 |
7 | 204365565 |
oct | 56020330 |
9 | 24631763 |
10 | 12067032 |
11 | 68a215a |
12 | 405b2a0 |
13 | 2666673 |
14 | 186186c |
15 | 10d563c |
hex | b820d8 |
12067032 has 64 divisors (see below), whose sum is σ = 31518720. Its totient is φ = 3846528.
The previous prime is 12067031. The next prime is 12067037. The reversal of 12067032 is 23076021.
It is a happy number.
It is a super-2 number, since 2×120670322 = 291226522578048, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12067031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94953 + ... + 95079.
It is an arithmetic number, because the mean of its divisors is an integer number (492480).
Almost surely, 212067032 is an apocalyptic number.
12067032 is a gapful number since it is divisible by the number (12) 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 12067032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15759360).
12067032 is an abundant number, since it is smaller than the sum of its proper divisors (19451688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12067032 is a wasteful number, since it uses less digits than its factorization.
12067032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280 (or 276 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 12067032 is about 3473.7633770883. The cubic root of 12067032 is about 229.3683487938.
The spelling of 12067032 in words is "twelve million, sixty-seven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •