Base | Representation |
---|---|
bin | 110000001110… |
… | …100100000000 |
3 | 212210022022222 |
4 | 300032210000 |
5 | 11214030220 |
6 | 1130550212 |
7 | 212313530 |
oct | 60164400 |
9 | 25708288 |
10 | 12642560 |
11 | 71555a7 |
12 | 4298368 |
13 | 2808608 |
14 | 19714c0 |
15 | 119ae25 |
hex | c0e900 |
12642560 has 144 divisors (see below), whose sum is σ = 37086336. Its totient is φ = 4030464.
The previous prime is 12642547. The next prime is 12642569. The reversal of 12642560 is 6524621.
It is not an unprimeable number, because it can be changed into a prime (12642569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 152279 + ... + 152361.
It is an arithmetic number, because the mean of its divisors is an integer number (257544).
Almost surely, 212642560 is an apocalyptic number.
12642560 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 12642560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18543168).
12642560 is an abundant number, since it is smaller than the sum of its proper divisors (24443776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12642560 is an equidigital number, since it uses as much as digits as its factorization.
12642560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 114 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 12642560 is about 3555.6377768271. The cubic root of 12642560 is about 232.9583819273.
The spelling of 12642560 in words is "twelve million, six hundred forty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •