Base | Representation |
---|---|
bin | 110000000110… |
… | …011010001001 |
3 | 212201121111222 |
4 | 300012122021 |
5 | 11211443121 |
6 | 1130131425 |
7 | 212114255 |
oct | 60063211 |
9 | 25647458 |
10 | 12609161 |
11 | 71324a4 |
12 | 4280b75 |
13 | 27c6356 |
14 | 1963265 |
15 | 11910ab |
hex | c06689 |
12609161 has 2 divisors, whose sum is σ = 12609162. Its totient is φ = 12609160.
The previous prime is 12609139. The next prime is 12609167. The reversal of 12609161 is 16190621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8880400 + 3728761 = 2980^2 + 1931^2 .
It is a cyclic number.
It is not a de Polignac number, because 12609161 - 26 = 12609097 is a prime.
It is a super-2 number, since 2×126091612 = 317981882247842, which contains 22 as substring.
It is a Chen prime.
It is equal to p825380 and since 12609161 and 825380 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12609161.
It is not a weakly prime, because it can be changed into another prime (12609167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6304580 + 6304581.
It is an arithmetic number, because the mean of its divisors is an integer number (6304581).
Almost surely, 212609161 is an apocalyptic number.
It is an amenable number.
12609161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12609161 is an equidigital number, since it uses as much as digits as its factorization.
12609161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 26.
The square root of 12609161 is about 3550.9380450805. The cubic root of 12609161 is about 232.7530585692.
Adding to 12609161 its reverse (16190621), we get a palindrome (28799782).
The spelling of 12609161 in words is "twelve million, six hundred nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •