Base | Representation |
---|---|
bin | 100101001100001110111… |
… | …0001110000110100110111 |
3 | 200002122200222002220201021 |
4 | 1022120131301300310313 |
5 | 1132221333212312201 |
6 | 14512110125042011 |
7 | 1035202666534222 |
oct | 112303561606467 |
9 | 20078628086637 |
10 | 5111510666551 |
11 | 16a0863572823 |
12 | 6a678a6b6307 |
13 | 2b10235494b3 |
14 | 1395814485b9 |
15 | 8ce6726dea1 |
hex | 4a61dc70d37 |
5111510666551 has 4 divisors (see below), whose sum is σ = 5137196650000. Its totient is φ = 5085824683104.
The previous prime is 5111510666533. The next prime is 5111510666557. The reversal of 5111510666551 is 1556660151115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5111510666551 - 211 = 5111510664503 is a prime.
It is a super-2 number, since 2×51115106665512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5111510666498 and 5111510666507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111510666557) 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, 12842991426 + ... + 12842991823.
It is an arithmetic number, because the mean of its divisors is an integer number (1284299162500).
Almost surely, 25111510666551 is an apocalyptic number.
5111510666551 is a deficient number, since it is larger than the sum of its proper divisors (25685983449).
5111510666551 is a wasteful number, since it uses less digits than its factorization.
5111510666551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25685983448.
The product of its (nonzero) digits is 135000, while the sum is 43.
The spelling of 5111510666551 in words is "five trillion, one hundred eleven billion, five hundred ten million, six hundred sixty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •