Base | Representation |
---|---|
bin | 100011100111101010111100… |
… | …0001011010101011101100001 |
3 | 1112002100200021212021020211112 |
4 | 1013033111320023111131201 |
5 | 312031330304342411223 |
6 | 3030211105401353105 |
7 | 122665206201035345 |
oct | 10717257013253541 |
9 | 1462320255236745 |
10 | 313315585513313 |
11 | 909174369a1329 |
12 | 2b1827ab798795 |
13 | 105a96c0b30956 |
14 | 57527ab879625 |
15 | 26350cdac4778 |
hex | 11cf5782d5761 |
313315585513313 has 8 divisors (see below), whose sum is σ = 314323693796736. Its totient is φ = 312307481478400.
The previous prime is 313315585513291. The next prime is 313315585513349.
313315585513313 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 313315585513313 - 232 = 313311290546017 is a prime.
It is a super-2 number, since 2×3133155855133132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313315585513393) 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, 221683268 + ... + 223092138.
It is an arithmetic number, because the mean of its divisors is an integer number (39290461724592).
Almost surely, 2313315585513313 is an apocalyptic number.
It is an amenable number.
313315585513313 is a deficient number, since it is larger than the sum of its proper divisors (1008108283423).
313315585513313 is a wasteful number, since it uses less digits than its factorization.
313315585513313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2124255.
The product of its digits is 3645000, while the sum is 50.
The spelling of 313315585513313 in words is "three hundred thirteen trillion, three hundred fifteen billion, five hundred eighty-five million, five hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •