Base | Representation |
---|---|
bin | 110000100110… |
… | …011111100000 |
3 | 212222021210012 |
4 | 300212133200 |
5 | 11230144301 |
6 | 1133024052 |
7 | 213202352 |
oct | 60463740 |
9 | 25867705 |
10 | 12740576 |
11 | 7212202 |
12 | 4325028 |
13 | 2841104 |
14 | 19990d2 |
15 | 11b9ebb |
hex | c267e0 |
12740576 has 12 divisors (see below), whose sum is σ = 25083072. Its totient is φ = 6370272.
The previous prime is 12740573. The next prime is 12740579. The reversal of 12740576 is 67504721.
It is an interprime number because it is at equal distance from previous prime (12740573) and next prime (12740579).
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 398143 = 12740576 / (1 + 2 + 7 + 4 + 0 + 5 + 7 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12740573) 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 as a sum of consecutive naturals, namely, 199040 + ... + 199103.
It is an arithmetic number, because the mean of its divisors is an integer number (2090256).
Almost surely, 212740576 is an apocalyptic number.
12740576 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12740576 is a deficient number, since it is larger than the sum of its proper divisors (12342496).
12740576 is an equidigital number, since it uses as much as digits as its factorization.
12740576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398153 (or 398145 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 32.
The square root of 12740576 is about 3569.3943463843. The cubic root of 12740576 is about 233.5588640270.
The spelling of 12740576 in words is "twelve million, seven hundred forty thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •