Base | Representation |
---|---|
bin | 110001011011… |
… | …000110110000 |
3 | 220101020101211 |
4 | 301123012300 |
5 | 11304043310 |
6 | 1141405504 |
7 | 215060554 |
oct | 61330660 |
9 | 26336354 |
10 | 12956080 |
11 | 734a105 |
12 | 4409894 |
13 | 28b8227 |
14 | 1a13864 |
15 | 120dc8a |
hex | c5b1b0 |
12956080 has 40 divisors (see below), whose sum is σ = 30560544. Its totient is φ = 5107200.
The previous prime is 12956071. The next prime is 12956087. The reversal of 12956080 is 8065921.
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12956087) 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 in 7 ways as a sum of consecutive naturals, for example, 4540 + ... + 6820.
Almost surely, 212956080 is an apocalyptic number.
12956080 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 12956080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15280272).
12956080 is an abundant number, since it is smaller than the sum of its proper divisors (17604464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12956080 is a wasteful number, since it uses less digits than its factorization.
12956080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2365 (or 2359 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 12956080 is about 3599.4555143799. The cubic root of 12956080 is about 234.8683735493.
The spelling of 12956080 in words is "twelve million, nine hundred fifty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •