Base | Representation |
---|---|
bin | 11101100000101011… |
… | …010110110001001001 |
3 | 10000210022012122100211 |
4 | 131200223112301021 |
5 | 1004343301434012 |
6 | 22320125001121 |
7 | 2201140632112 |
oct | 354053266111 |
9 | 100708178324 |
10 | 31686749257 |
11 | 12490386789 |
12 | 61839b31a1 |
13 | 2cac982297 |
14 | 1768481209 |
15 | c56c616a7 |
hex | 760ad6c49 |
31686749257 has 4 divisors (see below), whose sum is σ = 31691171476. Its totient is φ = 31682327040.
The previous prime is 31686749251. The next prime is 31686749261. The reversal of 31686749257 is 75294768613.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75294768613 = 103 ⋅731017171.
It can be written as a sum of positive squares in 2 ways, for example, as 30842033161 + 844716096 = 175619^2 + 29064^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31686749257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31686749251) 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, 2200344 + ... + 2214697.
It is an arithmetic number, because the mean of its divisors is an integer number (7922792869).
Almost surely, 231686749257 is an apocalyptic number.
It is an amenable number.
31686749257 is a deficient number, since it is larger than the sum of its proper divisors (4422219).
31686749257 is an equidigital number, since it uses as much as digits as its factorization.
31686749257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4422218.
The product of its digits is 15240960, while the sum is 58.
The spelling of 31686749257 in words is "thirty-one billion, six hundred eighty-six million, seven hundred forty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •