Base | Representation |
---|---|
bin | 100101001011101011001… |
… | …0001111110110101110101 |
3 | 200002112121101000022110221 |
4 | 1022113112101332311311 |
5 | 1132211404123344023 |
6 | 14511351115214341 |
7 | 1035131163043213 |
oct | 112272621766565 |
9 | 20075541008427 |
10 | 5110311153013 |
11 | 16a02a8469520 |
12 | 6a64b4a473b1 |
13 | 2b0b91b95581 |
14 | 1394aa003cb3 |
15 | 8cde6ccc85d |
hex | 4a5d647ed75 |
5110311153013 has 8 divisors (see below), whose sum is σ = 5725557459360. Its totient is φ = 4520176940880.
The previous prime is 5110311153007. The next prime is 5110311153023. The reversal of 5110311153013 is 3103511130115.
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 5110311153013 - 25 = 5110311152981 is a prime.
It is a super-2 number, since 2×51103111530132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110311153023) 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, 6278023123 + ... + 6278023936.
It is an arithmetic number, because the mean of its divisors is an integer number (715694682420).
Almost surely, 25110311153013 is an apocalyptic number.
It is an amenable number.
5110311153013 is a deficient number, since it is larger than the sum of its proper divisors (615246306347).
5110311153013 is a wasteful number, since it uses less digits than its factorization.
5110311153013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12556047107.
The product of its (nonzero) digits is 675, while the sum is 25.
Adding to 5110311153013 its reverse (3103511130115), we get a palindrome (8213822283128).
The spelling of 5110311153013 in words is "five trillion, one hundred ten billion, three hundred eleven million, one hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •