Base | Representation |
---|---|
bin | 101111111010… |
… | …100101100000 |
3 | 212122011002110 |
4 | 233322211200 |
5 | 11203420421 |
6 | 1125115320 |
7 | 211523136 |
oct | 57724540 |
9 | 25564073 |
10 | 12560736 |
11 | 70aa081 |
12 | 4258b40 |
13 | 27aa2b6 |
14 | 194d756 |
15 | 1181a76 |
hex | bfa960 |
12560736 has 24 divisors (see below), whose sum is σ = 32972184. Its totient is φ = 4186880.
The previous prime is 12560731. The next prime is 12560749. The reversal of 12560736 is 63706521.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12560731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65325 + ... + 65516.
It is an arithmetic number, because the mean of its divisors is an integer number (1373841).
Almost surely, 212560736 is an apocalyptic number.
12560736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12560736 is an abundant number, since it is smaller than the sum of its proper divisors (20411448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12560736 is a wasteful number, since it uses less digits than its factorization.
12560736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130854 (or 130846 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 30.
The square root of 12560736 is about 3544.1128650200. The cubic root of 12560736 is about 232.4547165826.
The spelling of 12560736 in words is "twelve million, five hundred sixty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •