Base | Representation |
---|---|
bin | 111011110010… |
… | …1010000000001 |
3 | 2011222121222102 |
4 | 1313211100001 |
5 | 31011111323 |
6 | 3035520145 |
7 | 530310515 |
oct | 167452001 |
9 | 64877872 |
10 | 31347713 |
11 | 16771001 |
12 | a5b9055 |
13 | 6657557 |
14 | 4240145 |
15 | 2b43328 |
hex | 1de5401 |
31347713 has 2 divisors, whose sum is σ = 31347714. Its totient is φ = 31347712.
The previous prime is 31347709. The next prime is 31347787. The reversal of 31347713 is 31774313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24127744 + 7219969 = 4912^2 + 2687^2 .
It is an emirp because it is prime and its reverse (31774313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31347713 - 22 = 31347709 is a prime.
It is a super-2 number, since 2×313477132 = 1965358220660738, which contains 22 as substring.
It is equal to p1936091 and since 31347713 and 1936091 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (31347793) 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, 15673856 + 15673857.
It is an arithmetic number, because the mean of its divisors is an integer number (15673857).
Almost surely, 231347713 is an apocalyptic number.
It is an amenable number.
31347713 is a deficient number, since it is larger than the sum of its proper divisors (1).
31347713 is an equidigital number, since it uses as much as digits as its factorization.
31347713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5292, while the sum is 29.
The square root of 31347713 is about 5598.9028389498. The cubic root of 31347713 is about 315.3082160022.
The spelling of 31347713 in words is "thirty-one million, three hundred forty-seven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •