Base | Representation |
---|---|
bin | 100011011001000110001001… |
… | …0011101011001101001111001 |
3 | 1111211021011210002212201020212 |
4 | 1012302030102131121221321 |
5 | 311301020321044304423 |
6 | 3022034541531000505 |
7 | 122400403040651531 |
oct | 10662142235315171 |
9 | 1454234702781225 |
10 | 311312424213113 |
11 | 9021494862a954 |
12 | 2aaba524b99135 |
13 | 1049283565a85b |
14 | 56c385d1d64c1 |
15 | 25ece3d2e0578 |
hex | 11b2312759a79 |
311312424213113 has 8 divisors (see below), whose sum is σ = 317962007176320. Its totient is φ = 304663921015120.
The previous prime is 311312424213067. The next prime is 311312424213143.
It is a happy number.
311312424213113 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 311312424213113 - 220 = 311312423164537 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 311312424213113.
It is not an unprimeable number, because it can be changed into a prime (311312424213143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269358503 + ... + 270511788.
It is an arithmetic number, because the mean of its divisors is an integer number (39745250897040).
Almost surely, 2311312424213113 is an apocalyptic number.
It is an amenable number.
311312424213113 is a deficient number, since it is larger than the sum of its proper divisors (6649582963207).
311312424213113 is a wasteful number, since it uses less digits than its factorization.
311312424213113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 539882607.
The product of its digits is 10368, while the sum is 32.
The spelling of 311312424213113 in words is "three hundred eleven trillion, three hundred twelve billion, four hundred twenty-four million, two hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •