Base | Representation |
---|---|
bin | 1001000011101011100… |
… | …00001110010111000001 |
3 | 1002202021222120200122012 |
4 | 10201311300032113001 |
5 | 20044331041040223 |
6 | 354545215222305 |
7 | 31325103506561 |
oct | 4416560162701 |
9 | 1082258520565 |
10 | 311213221313 |
11 | 10aa91828455 |
12 | 50394817995 |
13 | 23468c8c3c7 |
14 | 110c4476da1 |
15 | 8166d19c78 |
hex | 4875c0e5c1 |
311213221313 has 8 divisors (see below), whose sum is σ = 327767246400. Its totient is φ = 294676634448.
The previous prime is 311213221273. The next prime is 311213221357. The reversal of 311213221313 is 313122312113.
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 311213221313 - 220 = 311212172737 is a prime.
It is a super-3 number, since 3×3112132213133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311213221393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4322906 + ... + 4394307.
It is an arithmetic number, because the mean of its divisors is an integer number (40970905800).
Almost surely, 2311213221313 is an apocalyptic number.
It is an amenable number.
311213221313 is a deficient number, since it is larger than the sum of its proper divisors (16554025087).
311213221313 is a wasteful number, since it uses less digits than its factorization.
311213221313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8719111.
The product of its digits is 648, while the sum is 23.
Adding to 311213221313 its reverse (313122312113), we get a palindrome (624335533426).
The spelling of 311213221313 in words is "three hundred eleven billion, two hundred thirteen million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •