Base | Representation |
---|---|
bin | 110001001100… |
… | …100101010000 |
3 | 220021012210120 |
4 | 301030211100 |
5 | 11300142332 |
6 | 1140230240 |
7 | 214422252 |
oct | 61144520 |
9 | 26235716 |
10 | 12896592 |
11 | 7309445 |
12 | 439b380 |
13 | 2897127 |
14 | 19d9cd2 |
15 | 11eb32c |
hex | c4c950 |
12896592 has 80 divisors (see below), whose sum is σ = 35712000. Its totient is φ = 3998592.
The previous prime is 12896581. The next prime is 12896599. The reversal of 12896592 is 29569821.
Its product of digits (77760) is a multiple of the sum of its prime factors (288).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12896599) 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, 71959 + ... + 72137.
It is an arithmetic number, because the mean of its divisors is an integer number (446400).
Almost surely, 212896592 is an apocalyptic number.
12896592 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 12896592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17856000).
12896592 is an abundant number, since it is smaller than the sum of its proper divisors (22815408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12896592 is a wasteful number, since it uses less digits than its factorization.
12896592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288 (or 282 counting only the distinct ones).
The product of its digits is 77760, while the sum is 42.
The square root of 12896592 is about 3591.1825350433. The cubic root of 12896592 is about 234.5083549714.
The spelling of 12896592 in words is "twelve million, eight hundred ninety-six thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •