Base | Representation |
---|---|
bin | 101111010010… |
… | …101011011000 |
3 | 212022211212020 |
4 | 233102223120 |
5 | 11133203042 |
6 | 1121414440 |
7 | 210242436 |
oct | 57225330 |
9 | 25284766 |
10 | 12397272 |
11 | 6aa8288 |
12 | 419a420 |
13 | 2750a84 |
14 | 1909d56 |
15 | 114d3ec |
hex | bd2ad8 |
12397272 has 64 divisors (see below), whose sum is σ = 33715200. Its totient is φ = 3784320.
The previous prime is 12397261. The next prime is 12397277. The reversal of 12397272 is 27279321.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12397277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13698 + ... + 14574.
It is an arithmetic number, because the mean of its divisors is an integer number (526800).
Almost surely, 212397272 is an apocalyptic number.
12397272 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 12397272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16857600).
12397272 is an abundant number, since it is smaller than the sum of its proper divisors (21317928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12397272 is a wasteful number, since it uses less digits than its factorization.
12397272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936 (or 932 counting only the distinct ones).
The product of its digits is 10584, while the sum is 33.
The square root of 12397272 is about 3520.9760010543. The cubic root of 12397272 is about 231.4419305546.
The spelling of 12397272 in words is "twelve million, three hundred ninety-seven thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •