Base | Representation |
---|---|
bin | 100101001011101001011… |
… | …0110000011111000111011 |
3 | 200002112110100112100011122 |
4 | 1022113102312003320323 |
5 | 1132211244344031021 |
6 | 14511341255415455 |
7 | 1035126563031410 |
oct | 112272266037073 |
9 | 20075410470148 |
10 | 5110253502011 |
11 | 16a0278972469 |
12 | 6a649968458b |
13 | 2b0b82c5b858 |
14 | 1394a24b8107 |
15 | 8cde1be0bab |
hex | 4a5d2d83e3b |
5110253502011 has 4 divisors (see below), whose sum is σ = 5840289716592. Its totient is φ = 4380217287432.
The previous prime is 5110253501999. The next prime is 5110253502031. The reversal of 5110253502011 is 1102053520115.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5110253502011 - 230 = 5109179760187 is a prime.
It is a super-2 number, since 2×51102535020112 (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 (5110253502031) 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 3 ways as a sum of consecutive naturals, for example, 365018107280 + ... + 365018107293.
It is an arithmetic number, because the mean of its divisors is an integer number (1460072429148).
Almost surely, 25110253502011 is an apocalyptic number.
5110253502011 is a deficient number, since it is larger than the sum of its proper divisors (730036214581).
5110253502011 is an equidigital number, since it uses as much as digits as its factorization.
5110253502011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730036214580.
The product of its (nonzero) digits is 1500, while the sum is 26.
The spelling of 5110253502011 in words is "five trillion, one hundred ten billion, two hundred fifty-three million, five hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •