Base | Representation |
---|---|
bin | 1110001001101111110100… |
… | …00011001111001011010001 |
3 | 11002012011100020210110110022 |
4 | 13010313322003033023101 |
5 | 13034342241200241423 |
6 | 150104521442113225 |
7 | 6361302112423232 |
oct | 704677203171321 |
9 | 132164306713408 |
10 | 31121233212113 |
11 | 9a09493901630 |
12 | 35a760604b815 |
13 | 1449948244655 |
14 | 7983c0833089 |
15 | 38e8048e1dc8 |
hex | 1c4dfa0cf2d1 |
31121233212113 has 4 divisors (see below), whose sum is σ = 33950436231408. Its totient is φ = 28292030192820.
The previous prime is 31121233212109. The next prime is 31121233212137.
31121233212113 is nontrivially palindromic in base 10.
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 31121233212113 - 22 = 31121233212109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31121236212113) 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, 1414601509631 + ... + 1414601509652.
It is an arithmetic number, because the mean of its divisors is an integer number (8487609057852).
Almost surely, 231121233212113 is an apocalyptic number.
It is an amenable number.
31121233212113 is a deficient number, since it is larger than the sum of its proper divisors (2829203019295).
31121233212113 is a wasteful number, since it uses less digits than its factorization.
31121233212113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2829203019294.
The product of its digits is 1296, while the sum is 26.
It can be divided in two parts, 3112123 and 3212113, that added together give a palindrome (6324236).
The spelling of 31121233212113 in words is "thirty-one trillion, one hundred twenty-one billion, two hundred thirty-three million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •