Base | Representation |
---|---|
bin | 100011100101011110000110… |
… | …0100011111110001000100001 |
3 | 1112001021202121101020011022110 |
4 | 1013022330030203332020201 |
5 | 312011401343333240223 |
6 | 3025420125312025533 |
7 | 122634311134235514 |
oct | 10712741443761041 |
9 | 1461252541204273 |
10 | 313013132321313 |
11 | 9081013aa61626 |
12 | 2b1340608322a9 |
13 | 1058701c9b1158 |
14 | 5741cb89ccd7b |
15 | 262c2cad83d93 |
hex | 11caf0c8fe221 |
313013132321313 has 16 divisors (see below), whose sum is σ = 417988434959936. Its totient is φ = 208356634981440.
The previous prime is 313013132321291. The next prime is 313013132321317. The reversal of 313013132321313 is 313123231310313.
It is not a de Polignac number, because 313013132321313 - 225 = 313013098766881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313013132321317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136668906 + ... + 138940332.
It is an arithmetic number, because the mean of its divisors is an integer number (26124277184996).
Almost surely, 2313013132321313 is an apocalyptic number.
It is an amenable number.
313013132321313 is a deficient number, since it is larger than the sum of its proper divisors (104975302638623).
313013132321313 is a wasteful number, since it uses less digits than its factorization.
313013132321313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2341584.
The product of its (nonzero) digits is 8748, while the sum is 30.
Adding to 313013132321313 its reverse (313123231310313), we get a palindrome (626136363631626).
The spelling of 313013132321313 in words is "three hundred thirteen trillion, thirteen billion, one hundred thirty-two million, three hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •