Base | Representation |
---|---|
bin | 1001000111011000100… |
… | …10110110100011000111 |
3 | 1002221102120211122020222 |
4 | 10203230102312203013 |
5 | 20112414203312221 |
6 | 355514422014555 |
7 | 31425303106331 |
oct | 4435422664307 |
9 | 1087376748228 |
10 | 313202010311 |
11 | 110912408023 |
12 | 5084a87745b |
13 | 236c500c928 |
14 | 11232654451 |
15 | 82317159ab |
hex | 48ec4b68c7 |
313202010311 has 4 divisors (see below), whose sum is σ = 317166592800. Its totient is φ = 309237427824.
The previous prime is 313202010301. The next prime is 313202010313. The reversal of 313202010311 is 113010202313.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 313202010311 - 214 = 313201993927 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 313202010311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313202010313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1982291126 + ... + 1982291283.
It is an arithmetic number, because the mean of its divisors is an integer number (79291648200).
Almost surely, 2313202010311 is an apocalyptic number.
313202010311 is a deficient number, since it is larger than the sum of its proper divisors (3964582489).
313202010311 is an equidigital number, since it uses as much as digits as its factorization.
313202010311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3964582488.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 313202010311 its reverse (113010202313), we get a palindrome (426212212624).
The spelling of 313202010311 in words is "three hundred thirteen billion, two hundred two million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •