Base | Representation |
---|---|
bin | 110000110110… |
… | …011101000100 |
3 | 220002121110200 |
4 | 300312131010 |
5 | 11234242311 |
6 | 1134250500 |
7 | 213564102 |
oct | 60663504 |
9 | 26077420 |
10 | 12805956 |
11 | 7257339 |
12 | 4356a30 |
13 | 2864ab7 |
14 | 19b4c72 |
15 | 11ce556 |
hex | c36744 |
12805956 has 18 divisors (see below), whose sum is σ = 32370702. Its totient is φ = 4268640.
The previous prime is 12805937. The next prime is 12805967. The reversal of 12805956 is 65950821.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 12110400 + 695556 = 3480^2 + 834^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 355721 = 12805956 / (1 + 2 + 8 + 0 + 5 + 9 + 5 + 6).
It is a self number, because there is not a number n which added to its sum of digits gives 12805956.
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 5 ways as a sum of consecutive naturals, for example, 177825 + ... + 177896.
Almost surely, 212805956 is an apocalyptic number.
It is an amenable number.
12805956 is an abundant number, since it is smaller than the sum of its proper divisors (19564746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12805956 is a wasteful number, since it uses less digits than its factorization.
12805956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355731 (or 355726 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The square root of 12805956 is about 3578.5410434980. The cubic root of 12805956 is about 233.9576956177.
The spelling of 12805956 in words is "twelve million, eight hundred five thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •