Base | Representation |
---|---|
bin | 110000100000… |
… | …111100101110 |
3 | 212221010122020 |
4 | 300200330232 |
5 | 11223432440 |
6 | 1132331010 |
7 | 213046224 |
oct | 60407456 |
9 | 25833566 |
10 | 12717870 |
11 | 71a7140 |
12 | 4313a66 |
13 | 2833989 |
14 | 1990b14 |
15 | 11b33d0 |
hex | c20f2e |
12717870 has 64 divisors (see below), whose sum is σ = 35271936. Its totient is φ = 2900480.
The previous prime is 12717869. The next prime is 12717877. The reversal of 12717870 is 7871721.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12717877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4477 + ... + 6743.
It is an arithmetic number, because the mean of its divisors is an integer number (551124).
Almost surely, 212717870 is an apocalyptic number.
12717870 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12717870, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17635968).
12717870 is an abundant number, since it is smaller than the sum of its proper divisors (22554066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12717870 is a wasteful number, since it uses less digits than its factorization.
12717870 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2305.
The product of its (nonzero) digits is 5488, while the sum is 33.
The square root of 12717870 is about 3566.2122763515. The cubic root of 12717870 is about 233.4200335403.
The spelling of 12717870 in words is "twelve million, seven hundred seventeen thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •