Base | Representation |
---|---|
bin | 110001100110… |
… | …110111100101 |
3 | 220110200111022 |
4 | 301212313211 |
5 | 11312114021 |
6 | 1142420525 |
7 | 215351204 |
oct | 61466745 |
9 | 26420438 |
10 | 13004261 |
11 | 7382326 |
12 | 4431745 |
13 | 290413a |
14 | 1a2723b |
15 | 121d1ab |
hex | c66de5 |
13004261 has 2 divisors, whose sum is σ = 13004262. Its totient is φ = 13004260.
The previous prime is 13004207. The next prime is 13004263. The reversal of 13004261 is 16240031.
13004261 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9728161 + 3276100 = 3119^2 + 1810^2 .
It is a cyclic number.
It is not a de Polignac number, because 13004261 - 26 = 13004197 is a prime.
It is a super-2 number, since 2×130042612 = 338221608312242, which contains 22 as substring.
Together with 13004263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13004263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6502130 + 6502131.
It is an arithmetic number, because the mean of its divisors is an integer number (6502131).
Almost surely, 213004261 is an apocalyptic number.
It is an amenable number.
13004261 is a deficient number, since it is larger than the sum of its proper divisors (1).
13004261 is an equidigital number, since it uses as much as digits as its factorization.
13004261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 13004261 is about 3606.1421214367. The cubic root of 13004261 is about 235.1591558045.
Adding to 13004261 its reverse (16240031), we get a palindrome (29244292).
The spelling of 13004261 in words is "thirteen million, four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •