Base | Representation |
---|---|
bin | 101110010000… |
… | …110010100000 |
3 | 211211010122200 |
4 | 232100302200 |
5 | 11101034032 |
6 | 1111533200 |
7 | 205036554 |
oct | 56206240 |
9 | 24733580 |
10 | 12127392 |
11 | 6933542 |
12 | 408a200 |
13 | 2687c94 |
14 | 1879864 |
15 | 10e847c |
hex | b90ca0 |
12127392 has 72 divisors (see below), whose sum is σ = 36530676. Its totient is φ = 3803136.
The previous prime is 12127387. The next prime is 12127393. The reversal of 12127392 is 29372121.
It can be written as a sum of positive squares in 2 ways, for example, as 11861136 + 266256 = 3444^2 + 516^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is not an unprimeable number, because it can be changed into a prime (12127393) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3658 + ... + 6134.
Almost surely, 212127392 is an apocalyptic number.
12127392 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 12127392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18265338).
12127392 is an abundant number, since it is smaller than the sum of its proper divisors (24403284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12127392 is a wasteful number, since it uses less digits than its factorization.
12127392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2510 (or 2499 counting only the distinct ones).
The product of its digits is 1512, while the sum is 27.
The square root of 12127392 is about 3482.4405235409. The cubic root of 12127392 is about 229.7501508672.
The spelling of 12127392 in words is "twelve million, one hundred twenty-seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •