Base | Representation |
---|---|
bin | 110010001111… |
… | …110010000001 |
3 | 220210012100222 |
4 | 302033302001 |
5 | 11332444331 |
6 | 1150152425 |
7 | 216646604 |
oct | 62176201 |
9 | 26705328 |
10 | 13171841 |
11 | 7487221 |
12 | 44b2715 |
13 | 29624b7 |
14 | 1a6c33b |
15 | 1252b7b |
hex | c8fc81 |
13171841 has 2 divisors, whose sum is σ = 13171842. Its totient is φ = 13171840.
The previous prime is 13171819. The next prime is 13171843. The reversal of 13171841 is 14817131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12397441 + 774400 = 3521^2 + 880^2 .
It is a cyclic number.
It is not a de Polignac number, because 13171841 - 26 = 13171777 is a prime.
It is a Sophie Germain prime.
Together with 13171843, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13171841.
It is not a weakly prime, because it can be changed into another prime (13171843) 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 as a sum of consecutive naturals, namely, 6585920 + 6585921.
It is an arithmetic number, because the mean of its divisors is an integer number (6585921).
Almost surely, 213171841 is an apocalyptic number.
It is an amenable number.
13171841 is a deficient number, since it is larger than the sum of its proper divisors (1).
13171841 is an equidigital number, since it uses as much as digits as its factorization.
13171841 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 672, while the sum is 26.
The square root of 13171841 is about 3629.3031011477. The cubic root of 13171841 is about 236.1649772905.
Adding to 13171841 its reverse (14817131), we get a palindrome (27988972).
The spelling of 13171841 in words is "thirteen million, one hundred seventy-one thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •