Base | Representation |
---|---|
bin | 101101110010… |
… | …111001100001 |
3 | 211120220201012 |
4 | 231302321201 |
5 | 11033124321 |
6 | 1105150305 |
7 | 204016613 |
oct | 55627141 |
9 | 24526635 |
10 | 12004961 |
11 | 685a561 |
12 | 402b395 |
13 | 2644337 |
14 | 1846db3 |
15 | 10c205b |
hex | b72e61 |
12004961 has 4 divisors (see below), whose sum is σ = 12123924. Its totient is φ = 11886000.
The previous prime is 12004957. The next prime is 12004963. The reversal of 12004961 is 16940021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7054336 + 4950625 = 2656^2 + 2225^2 .
It is a cyclic number.
It is not a de Polignac number, because 12004961 - 22 = 12004957 is a prime.
It is a super-2 number, since 2×120049612 = 288238177223042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12004963) 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, 59330 + ... + 59531.
It is an arithmetic number, because the mean of its divisors is an integer number (3030981).
Almost surely, 212004961 is an apocalyptic number.
It is an amenable number.
12004961 is a deficient number, since it is larger than the sum of its proper divisors (118963).
12004961 is a wasteful number, since it uses less digits than its factorization.
12004961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118962.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 12004961 is about 3464.8175998168. The cubic root of 12004961 is about 228.9743937604.
Adding to 12004961 its reverse (16940021), we get a palindrome (28944982).
The spelling of 12004961 in words is "twelve million, four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •