Base | Representation |
---|---|
bin | 110001000101… |
… | …101111111000 |
3 | 220012210101211 |
4 | 301011233320 |
5 | 11243243400 |
6 | 1135452504 |
7 | 214244533 |
oct | 61055770 |
9 | 26183354 |
10 | 12868600 |
11 | 729a408 |
12 | 4387134 |
13 | 2887474 |
14 | 19cda1a |
15 | 11e2dba |
hex | c45bf8 |
12868600 has 72 divisors (see below), whose sum is σ = 31404240. Its totient is φ = 4901760.
The previous prime is 12868591. The next prime is 12868607. The reversal of 12868600 is 686821.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12868607) 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 17 ways as a sum of consecutive naturals, for example, 273777 + ... + 273823.
It is an arithmetic number, because the mean of its divisors is an integer number (436170).
Almost surely, 212868600 is an apocalyptic number.
12868600 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 12868600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15702120).
12868600 is an abundant number, since it is smaller than the sum of its proper divisors (18535640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12868600 is a wasteful number, since it uses less digits than its factorization.
12868600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 31.
The square root of 12868600 is about 3587.2830944881. The cubic root of 12868600 is about 234.3385655957.
The spelling of 12868600 in words is "twelve million, eight hundred sixty-eight thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •