Base | Representation |
---|---|
bin | 110000000110… |
… | …010000111000 |
3 | 212201120201000 |
4 | 300012100320 |
5 | 11211433233 |
6 | 1130125000 |
7 | 212112450 |
oct | 60062070 |
9 | 25646630 |
10 | 12608568 |
11 | 7132005 |
12 | 4280760 |
13 | 27c5cbb |
14 | 1962d60 |
15 | 1190d13 |
hex | c06438 |
12608568 has 128 divisors (see below), whose sum is σ = 41472000. Its totient is φ = 3473280.
The previous prime is 12608507. The next prime is 12608569. The reversal of 12608568 is 86580621.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12608569) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46738 + ... + 47006.
It is an arithmetic number, because the mean of its divisors is an integer number (324000).
Almost surely, 212608568 is an apocalyptic number.
12608568 is a gapful number since it is divisible by the number (18) 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 12608568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20736000).
12608568 is an abundant number, since it is smaller than the sum of its proper divisors (28863432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12608568 is a wasteful number, since it uses less digits than its factorization.
12608568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 322 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 12608568 is about 3550.8545450356. The cubic root of 12608568 is about 232.7494097743.
The spelling of 12608568 in words is "twelve million, six hundred eight thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •