Base | Representation |
---|---|
bin | 100011100111101001101111… |
… | …0010000010000011001001101 |
3 | 1112002100102121220000200012221 |
4 | 1013033103132100100121031 |
5 | 312031310012244041023 |
6 | 3030210001231455341 |
7 | 122665055203012522 |
oct | 10717233620203115 |
9 | 1462312556020187 |
10 | 313313003112013 |
11 | 90916331226a83 |
12 | 2b1821aa987551 |
13 | 105a939bb10148 |
14 | 57526048d9149 |
15 | 2634ecc01d85d |
hex | 11cf4de41064d |
313313003112013 has 16 divisors (see below), whose sum is σ = 344158515486720. Its totient is φ = 283904232652656.
The previous prime is 313313003112007. The next prime is 313313003112097. The reversal of 313313003112013 is 310211300313313.
It is a cyclic number.
It is not a de Polignac number, because 313313003112013 - 229 = 313312466241101 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 (313313003152013) 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, 7391145 + ... + 26100862.
It is an arithmetic number, because the mean of its divisors is an integer number (21509907217920).
Almost surely, 2313313003112013 is an apocalyptic number.
It is an amenable number.
313313003112013 is a deficient number, since it is larger than the sum of its proper divisors (30845512374707).
313313003112013 is a wasteful number, since it uses less digits than its factorization.
313313003112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33513456.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 313313003112013 its reverse (310211300313313), we get a palindrome (623524303425326).
The spelling of 313313003112013 in words is "three hundred thirteen trillion, three hundred thirteen billion, three million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •