Base | Representation |
---|---|
bin | 11100111000111110… |
… | …000100011010000101 |
3 | 2222001212200000221101 |
4 | 130320332010122011 |
5 | 1002012231104044 |
6 | 22130050220101 |
7 | 2145501314236 |
oct | 347076043205 |
9 | 88055600841 |
10 | 31020566149 |
11 | 12179334531 |
12 | 6018884631 |
13 | 2c049532b1 |
14 | 1703bcb08d |
15 | c1851dcd4 |
hex | 738f84685 |
31020566149 has 4 divisors (see below), whose sum is σ = 31022069260. Its totient is φ = 31019063040.
The previous prime is 31020566099. The next prime is 31020566177. The reversal of 31020566149 is 94166502013.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94166502013 = 59 ⋅1596042407.
It can be written as a sum of positive squares in 2 ways, for example, as 8183916225 + 22836649924 = 90465^2 + 151118^2 .
It is a cyclic number.
It is not a de Polignac number, because 31020566149 - 211 = 31020564101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31020566189) 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 3 ways as a sum of consecutive naturals, for example, 720162 + ... + 762019.
It is an arithmetic number, because the mean of its divisors is an integer number (7755517315).
Almost surely, 231020566149 is an apocalyptic number.
It is an amenable number.
31020566149 is a deficient number, since it is larger than the sum of its proper divisors (1503111).
31020566149 is a wasteful number, since it uses less digits than its factorization.
31020566149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1503110.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 31020566149 in words is "thirty-one billion, twenty million, five hundred sixty-six thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •