Base | Representation |
---|---|
bin | 110001011100… |
… | …011100000000 |
3 | 220101111212220 |
4 | 301130130000 |
5 | 11304232121 |
6 | 1141451040 |
7 | 215112510 |
oct | 61343400 |
9 | 26344786 |
10 | 12961536 |
11 | 7353215 |
12 | 4410a80 |
13 | 28ba863 |
14 | 1a15840 |
15 | 12106c6 |
hex | c5c700 |
12961536 has 72 divisors (see below), whose sum is σ = 39441024. Its totient is φ = 3701760.
The previous prime is 12961499. The next prime is 12961537. The reversal of 12961536 is 63516921.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12961497 and 12961506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12961537) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4171 + ... + 6581.
It is an arithmetic number, because the mean of its divisors is an integer number (547792).
Almost surely, 212961536 is an apocalyptic number.
12961536 is a gapful number since it is divisible by the number (16) 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 12961536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19720512).
12961536 is an abundant number, since it is smaller than the sum of its proper divisors (26479488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12961536 is an equidigital number, since it uses as much as digits as its factorization.
12961536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2437 (or 2423 counting only the distinct ones).
The product of its digits is 9720, while the sum is 33.
The square root of 12961536 is about 3600.2133270127. The cubic root of 12961536 is about 234.9013377898.
The spelling of 12961536 in words is "twelve million, nine hundred sixty-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •