Base | Representation |
---|---|
bin | 110001000011… |
… | …110110000000 |
3 | 220012101200221 |
4 | 301003312000 |
5 | 11243021200 |
6 | 1135352424 |
7 | 214213021 |
oct | 61036600 |
9 | 26171627 |
10 | 12860800 |
11 | 7294567 |
12 | 4382714 |
13 | 2883a54 |
14 | 19cac48 |
15 | 11e091a |
hex | c43d80 |
12860800 has 48 divisors (see below), whose sum is σ = 31778100. Its totient is φ = 5143040.
The previous prime is 12860797. The next prime is 12860803. The reversal of 12860800 is 806821.
It is an interprime number because it is at equal distance from previous prime (12860797) and next prime (12860803).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12860803) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1191 + ... + 5209.
Almost surely, 212860800 is an apocalyptic number.
12860800 is a gapful number since it is divisible by the number (10) 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 12860800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15889050).
12860800 is an abundant number, since it is smaller than the sum of its proper divisors (18917300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12860800 is an equidigital number, since it uses as much as digits as its factorization.
12860800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4043 (or 4026 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 25.
The square root of 12860800 is about 3586.1957559509. The cubic root of 12860800 is about 234.2912097518.
The spelling of 12860800 in words is "twelve million, eight hundred sixty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •