Base | Representation |
---|---|
bin | 100011100110001000000010… |
… | …1101010111010001110010011 |
3 | 1112001121101010010011211011010 |
4 | 1013030100011222322032103 |
5 | 312014340334004404021 |
6 | 3025525343543022003 |
7 | 122643650310416106 |
oct | 10714200552721623 |
9 | 1461541103154133 |
10 | 313103211013011 |
11 | 9084536503a981 |
12 | 2b1495bba3a903 |
13 | 10592676bc6163 |
14 | 57463c213273d |
15 | 262e7ee0a6976 |
hex | 11cc405aba393 |
313103211013011 has 4 divisors (see below), whose sum is σ = 417470948017352. Its totient is φ = 208735474008672.
The previous prime is 313103211013009. The next prime is 313103211013027. The reversal of 313103211013011 is 110310112301313.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 313103211013011 - 21 = 313103211013009 is a prime.
It is a super-2 number, since 2×3131032110130112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313103211013091) 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, 52183868502166 + ... + 52183868502171.
It is an arithmetic number, because the mean of its divisors is an integer number (104367737004338).
Almost surely, 2313103211013011 is an apocalyptic number.
313103211013011 is a deficient number, since it is larger than the sum of its proper divisors (104367737004341).
313103211013011 is a wasteful number, since it uses less digits than its factorization.
313103211013011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104367737004340.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 313103211013011 its reverse (110310112301313), we get a palindrome (423413323314324).
The spelling of 313103211013011 in words is "three hundred thirteen trillion, one hundred three billion, two hundred eleven million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •