Base | Representation |
---|---|
bin | 111011110000… |
… | …1000101000111 |
3 | 2011221202112202 |
4 | 1313201011013 |
5 | 31010040011 |
6 | 3035305115 |
7 | 530206643 |
oct | 167410507 |
9 | 64852482 |
10 | 31330631 |
11 | 1675a192 |
12 | a5ab19b |
13 | 664c847 |
14 | 4237c23 |
15 | 2b3d23b |
hex | 1de1147 |
31330631 has 4 divisors (see below), whose sum is σ = 31376664. Its totient is φ = 31284600.
The previous prime is 31330597. The next prime is 31330679. The reversal of 31330631 is 13603313.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13603313 = 103 ⋅132071.
It is a cyclic number.
It is not a de Polignac number, because 31330631 - 26 = 31330567 is a prime.
It is a super-2 number, since 2×313306312 = 1963216877716322, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31330681) 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 in 3 ways as a sum of consecutive naturals, for example, 21980 + ... + 23361.
It is an arithmetic number, because the mean of its divisors is an integer number (7844166).
Almost surely, 231330631 is an apocalyptic number.
31330631 is a deficient number, since it is larger than the sum of its proper divisors (46033).
31330631 is an equidigital number, since it uses as much as digits as its factorization.
31330631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46032.
The product of its (nonzero) digits is 486, while the sum is 20.
The square root of 31330631 is about 5597.3771536319. The cubic root of 31330631 is about 315.2509329975.
Adding to 31330631 its reverse (13603313), we get a palindrome (44933944).
The spelling of 31330631 in words is "thirty-one million, three hundred thirty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •