Base | Representation |
---|---|
bin | 100101001101001010111… |
… | …0010011100001010110001 |
3 | 200002211220021202102212220 |
4 | 1022122111302130022301 |
5 | 1132234444133010001 |
6 | 14513042012111253 |
7 | 1035303615526566 |
oct | 112322562341261 |
9 | 20084807672786 |
10 | 5113524110001 |
11 | 16a16a706167a |
12 | 6a7050a65529 |
13 | 2b128471c858 |
14 | 1396d2a0286d |
15 | 8d033dd9c36 |
hex | 4a695c9c2b1 |
5113524110001 has 4 divisors (see below), whose sum is σ = 6818032146672. Its totient is φ = 3409016073332.
The previous prime is 5113524109979. The next prime is 5113524110027. The reversal of 5113524110001 is 1000114253115.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5113524110001 - 26 = 5113524109937 is a prime.
It is a super-2 number, since 2×51135241100012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5113524110041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 852254018331 + ... + 852254018336.
It is an arithmetic number, because the mean of its divisors is an integer number (1704508036668).
Almost surely, 25113524110001 is an apocalyptic number.
It is an amenable number.
5113524110001 is a deficient number, since it is larger than the sum of its proper divisors (1704508036671).
5113524110001 is a wasteful number, since it uses less digits than its factorization.
5113524110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1704508036670.
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 5113524110001 its reverse (1000114253115), we get a palindrome (6113638363116).
The spelling of 5113524110001 in words is "five trillion, one hundred thirteen billion, five hundred twenty-four million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •