Base | Representation |
---|---|
bin | 11101001010011010… |
… | …110011111000101001 |
3 | 2222211021112010120020 |
4 | 131022122303320221 |
5 | 1003112202011241 |
6 | 22215104551053 |
7 | 2155654525443 |
oct | 351232637051 |
9 | 88737463506 |
10 | 31313313321 |
11 | 12309604844 |
12 | 609a922489 |
13 | 2c504b1a84 |
14 | 1730a33493 |
15 | c34098b66 |
hex | 74a6b3e29 |
31313313321 has 8 divisors (see below), whose sum is σ = 41818754784. Its totient is φ = 20841707040.
The previous prime is 31313313287. The next prime is 31313313377. The reversal of 31313313321 is 12331331313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31313313321 - 27 = 31313313193 is a prime.
It is a super-2 number, since 2×313133133212 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31313313291 and 31313313300.
It is not an unprimeable number, because it can be changed into a prime (31313313721) 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 7 ways as a sum of consecutive naturals, for example, 8456635 + ... + 8460336.
It is an arithmetic number, because the mean of its divisors is an integer number (5227344348).
Almost surely, 231313313321 is an apocalyptic number.
It is an amenable number.
31313313321 is a deficient number, since it is larger than the sum of its proper divisors (10505441463).
31313313321 is a wasteful number, since it uses less digits than its factorization.
31313313321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16917591.
The product of its digits is 1458, while the sum is 24.
Adding to 31313313321 its reverse (12331331313), we get a palindrome (43644644634).
The spelling of 31313313321 in words is "thirty-one billion, three hundred thirteen million, three hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •