Base | Representation |
---|---|
bin | 110001011111… |
… | …000110010000 |
3 | 220102001211110 |
4 | 301133012100 |
5 | 11310104212 |
6 | 1142013320 |
7 | 215156334 |
oct | 61370620 |
9 | 26361743 |
10 | 12972432 |
11 | 7360420 |
12 | 4417240 |
13 | 28c27c5 |
14 | 1a197c4 |
15 | 1213a3c |
hex | c5f190 |
12972432 has 80 divisors (see below), whose sum is σ = 37140480. Its totient is φ = 3868800.
The previous prime is 12972371. The next prime is 12972457. The reversal of 12972432 is 23427921.
It is a self number, because there is not a number n which added to its sum of digits gives 12972432.
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 15 ways as a sum of consecutive naturals, for example, 41557 + ... + 41867.
It is an arithmetic number, because the mean of its divisors is an integer number (464256).
Almost surely, 212972432 is an apocalyptic number.
12972432 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 12972432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18570240).
12972432 is an abundant number, since it is smaller than the sum of its proper divisors (24168048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12972432 is a wasteful number, since it uses less digits than its factorization.
12972432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412 (or 406 counting only the distinct ones).
The product of its digits is 6048, while the sum is 30.
The square root of 12972432 is about 3601.7262527849. The cubic root of 12972432 is about 234.9671419278.
The spelling of 12972432 in words is "twelve million, nine hundred seventy-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •