Base | Representation |
---|---|
bin | 11101100010010011… |
… | …111110001101100001 |
3 | 10000212012210221202101 |
4 | 131202103332031201 |
5 | 1004422312030133 |
6 | 22322544450401 |
7 | 2201623013041 |
oct | 354223761541 |
9 | 100765727671 |
10 | 31714173793 |
11 | 124a4908195 |
12 | 6191019a01 |
13 | 2cb5564c13 |
14 | 176bd7d721 |
15 | c5937c37d |
hex | 7624fe361 |
31714173793 has 4 divisors (see below), whose sum is σ = 31822413588. Its totient is φ = 31605934000.
The previous prime is 31714173781. The next prime is 31714173811. The reversal of 31714173793 is 39737141713.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 39737141713 = 108293 ⋅366941.
It can be written as a sum of positive squares in 2 ways, for example, as 28617473889 + 3096699904 = 169167^2 + 55648^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31714173793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31714173193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54119458 + ... + 54120043.
It is an arithmetic number, because the mean of its divisors is an integer number (7955603397).
Almost surely, 231714173793 is an apocalyptic number.
It is an amenable number.
31714173793 is a deficient number, since it is larger than the sum of its proper divisors (108239795).
31714173793 is a wasteful number, since it uses less digits than its factorization.
31714173793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108239794.
The product of its digits is 333396, while the sum is 46.
The spelling of 31714173793 in words is "thirty-one billion, seven hundred fourteen million, one hundred seventy-three thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •