Base | Representation |
---|---|
bin | 111100010010… |
… | …1100011101001 |
3 | 2012111000021222 |
4 | 1320211203221 |
5 | 31043023423 |
6 | 3045311425 |
7 | 532455452 |
oct | 170454351 |
9 | 65430258 |
10 | 31611113 |
11 | 16930996 |
12 | a705575 |
13 | 671a401 |
14 | 42ac129 |
15 | 2b963c8 |
hex | 1e258e9 |
31611113 has 2 divisors, whose sum is σ = 31611114. Its totient is φ = 31611112.
The previous prime is 31611101. The next prime is 31611127. The reversal of 31611113 is 31111613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28761769 + 2849344 = 5363^2 + 1688^2 .
It is a cyclic number.
It is not a de Polignac number, because 31611113 - 26 = 31611049 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 = 31611091 and 31611100.
It is not a weakly prime, because it can be changed into another prime (31611163) 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, 15805556 + 15805557.
It is an arithmetic number, because the mean of its divisors is an integer number (15805557).
Almost surely, 231611113 is an apocalyptic number.
It is an amenable number.
31611113 is a deficient number, since it is larger than the sum of its proper divisors (1).
31611113 is an equidigital number, since it uses as much as digits as its factorization.
31611113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54, while the sum is 17.
The square root of 31611113 is about 5622.3760991239. The cubic root of 31611113 is about 316.1888825636.
Adding to 31611113 its reverse (31111613), we get a palindrome (62722726).
Subtracting from 31611113 its reverse (31111613), we obtain a triangular number (499500 = T999).
The spelling of 31611113 in words is "thirty-one million, six hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •