Base | Representation |
---|---|
bin | 1110001001001110011100… |
… | …11101110001010111011101 |
3 | 11002010110002222212202100112 |
4 | 13010213032131301113131 |
5 | 13034044100424214323 |
6 | 150052400252535405 |
7 | 6360066213456065 |
oct | 704471635612735 |
9 | 132113088782315 |
10 | 31103322101213 |
11 | 9a0193251193a |
12 | 35a4047781565 |
13 | 144805256748b |
14 | 7975a1b443a5 |
15 | 38e107246178 |
hex | 1c49ce7715dd |
31103322101213 has 4 divisors (see below), whose sum is σ = 31117917749568. Its totient is φ = 31088726452860.
The previous prime is 31103322101179. The next prime is 31103322101219. The reversal of 31103322101213 is 31210122330113.
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 31103322101213 - 26 = 31103322101149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31103322101219) 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, 7297820981 + ... + 7297825242.
It is an arithmetic number, because the mean of its divisors is an integer number (7779479437392).
Almost surely, 231103322101213 is an apocalyptic number.
It is an amenable number.
31103322101213 is a deficient number, since it is larger than the sum of its proper divisors (14595648355).
31103322101213 is a wasteful number, since it uses less digits than its factorization.
31103322101213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14595648354.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 31103322101213 its reverse (31210122330113), we get a palindrome (62313444431326).
The spelling of 31103322101213 in words is "thirty-one trillion, one hundred three billion, three hundred twenty-two million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •