Base | Representation |
---|---|
bin | 110000100111… |
… | …010000000000 |
3 | 212222110001011 |
4 | 300213100000 |
5 | 11230244210 |
6 | 1133050304 |
7 | 213214405 |
oct | 60472000 |
9 | 25873034 |
10 | 12743680 |
11 | 7214574 |
12 | 4326994 |
13 | 2842651 |
14 | 199a2ac |
15 | 11bad8a |
hex | c27400 |
12743680 has 88 divisors (see below), whose sum is σ = 32424480. Its totient is φ = 4792320.
The previous prime is 12743677. The next prime is 12743681. The reversal of 12743680 is 8634721.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12743681) 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 7 ways as a sum of consecutive naturals, for example, 97215 + ... + 97345.
It is an arithmetic number, because the mean of its divisors is an integer number (368460).
Almost surely, 212743680 is an apocalyptic number.
12743680 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 12743680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16212240).
12743680 is an abundant number, since it is smaller than the sum of its proper divisors (19680800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12743680 is a wasteful number, since it uses less digits than its factorization.
12743680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175 (or 157 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 31.
The square root of 12743680 is about 3569.8291275634. The cubic root of 12743680 is about 233.5778298845.
The spelling of 12743680 in words is "twelve million, seven hundred forty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •