Base | Representation |
---|---|
bin | 111011001000… |
… | …1100101110001 |
3 | 2011100012220212 |
4 | 1312101211301 |
5 | 30414130131 |
6 | 3024313505 |
7 | 524352464 |
oct | 166214561 |
9 | 64305825 |
10 | 31005041 |
11 | 16557601 |
12 | a472895 |
13 | 65675a2 |
14 | 41912db |
15 | 2ac6a2b |
hex | 1d91971 |
31005041 has 2 divisors, whose sum is σ = 31005042. Its totient is φ = 31005040.
The previous prime is 31004977. The next prime is 31005047. The reversal of 31005041 is 14050013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25715041 + 5290000 = 5071^2 + 2300^2 .
It is an emirp because it is prime and its reverse (14050013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31005041 - 26 = 31004977 is a prime.
It is a super-2 number, since 2×310050412 = 1922625134823362, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (31005047) 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, 15502520 + 15502521.
It is an arithmetic number, because the mean of its divisors is an integer number (15502521).
Almost surely, 231005041 is an apocalyptic number.
It is an amenable number.
31005041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31005041 is an equidigital number, since it uses as much as digits as its factorization.
31005041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 31005041 is about 5568.2170395918. The cubic root of 31005041 is about 314.1550919505.
Adding to 31005041 its reverse (14050013), we get a palindrome (45055054).
The spelling of 31005041 in words is "thirty-one million, five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •