Base | Representation |
---|---|
bin | 100011100101100010110010… |
… | …1111110010000110010111001 |
3 | 1112001022201122120100012212010 |
4 | 1013023011211332100302321 |
5 | 312012033024403222223 |
6 | 3025424514431440133 |
7 | 122635116153640311 |
oct | 10713054576206271 |
9 | 1461281576305763 |
10 | 313023222320313 |
11 | 9081444855717a |
12 | 2b135bb7986049 |
13 | 10587c6a21cc6b |
14 | 5742594a9c441 |
15 | 262c6bbabd393 |
hex | 11cb165f90cb9 |
313023222320313 has 8 divisors (see below), whose sum is σ = 417398627667328. Its totient is φ = 208664982593424.
The previous prime is 313023222320293. The next prime is 313023222320321.
313023222320313 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313023222320313 - 237 = 312885783366841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313023222120313) 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, 4291362481 + ... + 4291435422.
It is an arithmetic number, because the mean of its divisors is an integer number (52174828458416).
Almost surely, 2313023222320313 is an apocalyptic number.
It is an amenable number.
313023222320313 is a deficient number, since it is larger than the sum of its proper divisors (104375405347015).
313023222320313 is a wasteful number, since it uses less digits than its factorization.
313023222320313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8582810063.
The product of its (nonzero) digits is 23328, while the sum is 30.
It can be divided in two parts, 3130232 and 22320313, that added together give a triangular number (25450545 = T7134).
The spelling of 313023222320313 in words is "three hundred thirteen trillion, twenty-three billion, two hundred twenty-two million, three hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •