Base | Representation |
---|---|
bin | 100011100101110000110101… |
… | …0100000101010000000000111 |
3 | 1112001102121110010202101022111 |
4 | 1013023201222200222000013 |
5 | 312013031241440411031 |
6 | 3025450421335441451 |
7 | 122640234114221020 |
oct | 10713415240520007 |
9 | 1461377403671274 |
10 | 313053363216391 |
11 | 90826205284546 |
12 | 2b13ba09b26287 |
13 | 1058aa61847205 |
14 | 5743c13b01c47 |
15 | 262d382c791b1 |
hex | 11cb86a82a007 |
313053363216391 has 8 divisors (see below), whose sum is σ = 373330718866944. Its totient is φ = 256664869220760.
The previous prime is 313053363216389. The next prime is 313053363216409. The reversal of 313053363216391 is 193612363350313.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313053363216391 - 21 = 313053363216389 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 (313053363216371) 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 7 ways as a sum of consecutive naturals, for example, 972215413555 + ... + 972215413876.
It is an arithmetic number, because the mean of its divisors is an integer number (46666339858368).
Almost surely, 2313053363216391 is an apocalyptic number.
313053363216391 is a deficient number, since it is larger than the sum of its proper divisors (60277355650553).
313053363216391 is a wasteful number, since it uses less digits than its factorization.
313053363216391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1944430827461.
The product of its (nonzero) digits is 2361960, while the sum is 49.
The spelling of 313053363216391 in words is "three hundred thirteen trillion, fifty-three billion, three hundred sixty-three million, two hundred sixteen thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •