Base | Representation |
---|---|
bin | 110001011011… |
… | …001101100000 |
3 | 220101020222211 |
4 | 301123031200 |
5 | 11304102022 |
6 | 1141411504 |
7 | 215062042 |
oct | 61331540 |
9 | 26336884 |
10 | 12956512 |
11 | 734a468 |
12 | 4409b94 |
13 | 28b849a |
14 | 1a13a92 |
15 | 120de77 |
hex | c5b360 |
12956512 has 48 divisors (see below), whose sum is σ = 27119232. Its totient is φ = 6082560.
The previous prime is 12956509. The next prime is 12956563. The reversal of 12956512 is 21565921.
It is a super-2 number, since 2×129565122 = 335742406412288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 36528 + ... + 36880.
It is an arithmetic number, because the mean of its divisors is an integer number (564984).
Almost surely, 212956512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12956512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13559616).
12956512 is an abundant number, since it is smaller than the sum of its proper divisors (14162720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12956512 is a wasteful number, since it uses less digits than its factorization.
12956512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431 (or 423 counting only the distinct ones).
The product of its digits is 5400, while the sum is 31.
The square root of 12956512 is about 3599.5155229558. The cubic root of 12956512 is about 234.8709839585.
The spelling of 12956512 in words is "twelve million, nine hundred fifty-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •