Base | Representation |
---|---|
bin | 110000010000… |
… | …110111101001 |
3 | 212210210021221 |
4 | 300100313221 |
5 | 11214331014 |
6 | 1131102041 |
7 | 212353216 |
oct | 60206751 |
9 | 25723257 |
10 | 12652009 |
11 | 7161707 |
12 | 42a1921 |
13 | 280c9c6 |
14 | 1974b0d |
15 | 119db24 |
hex | c10de9 |
12652009 has 4 divisors (see below), whose sum is σ = 12725316. Its totient is φ = 12578704.
The previous prime is 12652007. The next prime is 12652027. The reversal of 12652009 is 90025621.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 90025621 = 7 ⋅12860803.
It can be written as a sum of positive squares in 2 ways, for example, as 10705984 + 1946025 = 3272^2 + 1395^2 .
It is a cyclic number.
It is not a de Polignac number, because 12652009 - 21 = 12652007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12652007) 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 3 ways as a sum of consecutive naturals, for example, 36394 + ... + 36739.
It is an arithmetic number, because the mean of its divisors is an integer number (3181329).
Almost surely, 212652009 is an apocalyptic number.
It is an amenable number.
12652009 is a deficient number, since it is larger than the sum of its proper divisors (73307).
12652009 is an equidigital number, since it uses as much as digits as its factorization.
12652009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73306.
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 12652009 is about 3556.9662635454. The cubic root of 12652009 is about 233.0164048695.
It can be divided in two parts, 1265 and 2009, that multiplied together give a triangular number (2541385 = T2254).
The spelling of 12652009 in words is "twelve million, six hundred fifty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •