Base | Representation |
---|---|
bin | 100101001011111111111… |
… | …1111101101010001100001 |
3 | 200002121102010220111122210 |
4 | 1022113333333231101201 |
5 | 1132214322304134122 |
6 | 14511544355352333 |
7 | 1035154421511453 |
oct | 112277777552141 |
9 | 20077363814583 |
10 | 5111011005537 |
11 | 16a0627518038 |
12 | 6a666b2b26a9 |
13 | 2b0c73b827a8 |
14 | 139534d402d3 |
15 | 8ce3847140c |
hex | 4a5fffed461 |
5111011005537 has 8 divisors (see below), whose sum is σ = 6973162302304. Its totient is φ = 3328100189568.
The previous prime is 5111011005473. The next prime is 5111011005613. The reversal of 5111011005537 is 7355001101115.
5111011005537 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5111011005537 - 26 = 5111011005473 is a prime.
It is a super-2 number, since 2×51110110055372 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5111011005337) 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, 19810120048 + ... + 19810120305.
It is an arithmetic number, because the mean of its divisors is an integer number (871645287788).
Almost surely, 25111011005537 is an apocalyptic number.
It is an amenable number.
5111011005537 is a deficient number, since it is larger than the sum of its proper divisors (1862151296767).
5111011005537 is a wasteful number, since it uses less digits than its factorization.
5111011005537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39620240399.
The product of its (nonzero) digits is 2625, while the sum is 30.
The spelling of 5111011005537 in words is "five trillion, one hundred eleven billion, eleven million, five thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •