Base | Representation |
---|---|
bin | 1110011011110100100110… |
… | …00001101011101010101001 |
3 | 11011101112100201111120010022 |
4 | 13031322103001223222221 |
5 | 13130031134400243233 |
6 | 151302111055130225 |
7 | 6454206110540360 |
oct | 715722301535251 |
9 | 134345321446108 |
10 | 31742275009193 |
11 | a1289067a5771 |
12 | 3687a47813975 |
13 | 149338c35c458 |
14 | 7ba4974aa7d7 |
15 | 3a0a51bb6398 |
hex | 1cde9306baa9 |
31742275009193 has 4 divisors (see below), whose sum is σ = 36276885724800. Its totient is φ = 27207664293588.
The previous prime is 31742275009163. The next prime is 31742275009231. The reversal of 31742275009193 is 39190057224713.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31742275009193 - 242 = 27344228498089 is a prime.
It is a super-2 number, since 2×317422750091932 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (31742275009163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2267305357793 + ... + 2267305357806.
It is an arithmetic number, because the mean of its divisors is an integer number (9069221431200).
Almost surely, 231742275009193 is an apocalyptic number.
It is an amenable number.
31742275009193 is a deficient number, since it is larger than the sum of its proper divisors (4534610715607).
31742275009193 is an equidigital number, since it uses as much as digits as its factorization.
31742275009193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4534610715606.
The product of its (nonzero) digits is 2857680, while the sum is 53.
The spelling of 31742275009193 in words is "thirty-one trillion, seven hundred forty-two billion, two hundred seventy-five million, nine thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •