Base | Representation |
---|---|
bin | 111011010110… |
… | …0111010111101 |
3 | 2011112220111002 |
4 | 1312230322331 |
5 | 30431220424 |
6 | 3030540045 |
7 | 525330041 |
oct | 166547275 |
9 | 64486432 |
10 | 31116989 |
11 | 16623722 |
12 | a507625 |
13 | 65a6527 |
14 | 41c0021 |
15 | 2ae9cae |
hex | 1dacebd |
31116989 has 8 divisors (see below), whose sum is σ = 32023512. Its totient is φ = 30222400.
The previous prime is 31116959. The next prime is 31116997. The reversal of 31116989 is 98961113.
It can be written as a sum of positive squares in 4 ways, for example, as 19096900 + 12020089 = 4370^2 + 3467^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31116989 is a prime.
It is a super-2 number, since 2×311169892 = 1936534008852242, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31116959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2447 + ... + 8259.
It is an arithmetic number, because the mean of its divisors is an integer number (4002939).
Almost surely, 231116989 is an apocalyptic number.
It is an amenable number.
31116989 is a deficient number, since it is larger than the sum of its proper divisors (906523).
31116989 is a wasteful number, since it uses less digits than its factorization.
31116989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5967.
The product of its digits is 11664, while the sum is 38.
The square root of 31116989 is about 5578.2603919143. The cubic root of 31116989 is about 314.5327379746.
The spelling of 31116989 in words is "thirty-one million, one hundred sixteen thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •