Base | Representation |
---|---|
bin | 110001001110… |
… | …111000111001 |
3 | 220021200202112 |
4 | 301032320321 |
5 | 11300443131 |
6 | 1140342105 |
7 | 214461641 |
oct | 61167071 |
9 | 26250675 |
10 | 12906041 |
11 | 7315555 |
12 | 43a4935 |
13 | 289b515 |
14 | 19dd521 |
15 | 11ee02b |
hex | c4ee39 |
12906041 has 2 divisors, whose sum is σ = 12906042. Its totient is φ = 12906040.
The previous prime is 12906029. The next prime is 12906053. The reversal of 12906041 is 14060921.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (12906029) and next prime (12906053).
It can be written as a sum of positive squares in only one way, i.e., 11417641 + 1488400 = 3379^2 + 1220^2 .
It is a cyclic number.
It is not a de Polignac number, because 12906041 - 222 = 8711737 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12905998 and 12906016.
It is not a weakly prime, because it can be changed into another prime (12906001) 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 as a sum of consecutive naturals, namely, 6453020 + 6453021.
It is an arithmetic number, because the mean of its divisors is an integer number (6453021).
Almost surely, 212906041 is an apocalyptic number.
It is an amenable number.
12906041 is a deficient number, since it is larger than the sum of its proper divisors (1).
12906041 is an equidigital number, since it uses as much as digits as its factorization.
12906041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 12906041 is about 3592.4978775220. The cubic root of 12906041 is about 234.5656137287.
Adding to 12906041 its reverse (14060921), we get a palindrome (26966962).
The spelling of 12906041 in words is "twelve million, nine hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •