Base | Representation |
---|---|
bin | 100011100110001011101011… |
… | …1001100110010110100010101 |
3 | 1112001122010021102121120010010 |
4 | 1013030113113030302310111 |
5 | 312020002332423113023 |
6 | 3025533114544350433 |
7 | 122644344665651055 |
oct | 10714272714626425 |
9 | 1461563242546103 |
10 | 313111021301013 |
11 | 90848702811951 |
12 | 2b14b01b615419 |
13 | 10593320044950 |
14 | 5746923535565 |
15 | 262eb09acb093 |
hex | 11cc5d7332d15 |
313111021301013 has 16 divisors (see below), whose sum is σ = 449653846502336. Its totient is φ = 192658619473920.
The previous prime is 313111021300997. The next prime is 313111021301051. The reversal of 313111021301013 is 310103120111313.
It is not a de Polignac number, because 313111021301013 - 24 = 313111021300997 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 (313111021301413) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 522320395 + ... + 522919512.
It is an arithmetic number, because the mean of its divisors is an integer number (28103365406396).
Almost surely, 2313111021301013 is an apocalyptic number.
It is an amenable number.
313111021301013 is a deficient number, since it is larger than the sum of its proper divisors (136542825201323).
313111021301013 is a wasteful number, since it uses less digits than its factorization.
313111021301013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1045247604.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 313111021301013 its reverse (310103120111313), we get a palindrome (623214141412326).
The spelling of 313111021301013 in words is "three hundred thirteen trillion, one hundred eleven billion, twenty-one million, three hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •