Base | Representation |
---|---|
bin | 111011100011… |
… | …1000100110001 |
3 | 2011202100102122 |
4 | 1313013010301 |
5 | 30443132423 |
6 | 3033124025 |
7 | 526254254 |
oct | 167070461 |
9 | 64670378 |
10 | 31224113 |
11 | 16697158 |
12 | a559615 |
13 | 661320b |
14 | 420b09b |
15 | 2b1b8c8 |
hex | 1dc7131 |
31224113 has 2 divisors, whose sum is σ = 31224114. Its totient is φ = 31224112.
The previous prime is 31224091. The next prime is 31224199. The reversal of 31224113 is 31142213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29463184 + 1760929 = 5428^2 + 1327^2 .
It is an emirp because it is prime and its reverse (31142213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31224113 - 222 = 27029809 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31224091 and 31224100.
It is not a weakly prime, because it can be changed into another prime (31224313) 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, 15612056 + 15612057.
It is an arithmetic number, because the mean of its divisors is an integer number (15612057).
Almost surely, 231224113 is an apocalyptic number.
It is an amenable number.
31224113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31224113 is an equidigital number, since it uses as much as digits as its factorization.
31224113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144, while the sum is 17.
The square root of 31224113 is about 5587.8540603706. The cubic root of 31224113 is about 314.8932635765.
Adding to 31224113 its reverse (31142213), we get a palindrome (62366326).
The spelling of 31224113 in words is "thirty-one million, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •