Base | Representation |
---|---|
bin | 100011100110000110100110… |
… | …1100011110011110100001101 |
3 | 1112001121002010211221000110122 |
4 | 1013030031031203303310031 |
5 | 312014313022232102023 |
6 | 3025524113241514325 |
7 | 122643510622441121 |
oct | 10714151543636415 |
9 | 1461532124830418 |
10 | 313100122144013 |
11 | 9084401a4a0986 |
12 | 2b148a994a29a5 |
13 | 105922a3c97719 |
14 | 57461abbd5581 |
15 | 262e6bcd0b2c8 |
hex | 11cc34d8f3d0d |
313100122144013 has 8 divisors (see below), whose sum is σ = 314416889740800. Its totient is φ = 311783410591408.
The previous prime is 313100122143979. The next prime is 313100122144049. The reversal of 313100122144013 is 310441221001313.
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 313100122144013 - 226 = 313100055035149 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 (313100122144063) 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, 2795381 + ... + 25179642.
It is an arithmetic number, because the mean of its divisors is an integer number (39302111217600).
Almost surely, 2313100122144013 is an apocalyptic number.
It is an amenable number.
313100122144013 is a deficient number, since it is larger than the sum of its proper divisors (1316767596787).
313100122144013 is a wasteful number, since it uses less digits than its factorization.
313100122144013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28022091.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 313100122144013 its reverse (310441221001313), we get a palindrome (623541343145326).
The spelling of 313100122144013 in words is "three hundred thirteen trillion, one hundred billion, one hundred twenty-two million, one hundred forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •