Base | Representation |
---|---|
bin | 100101001100010011000… |
… | …1001101011111011001101 |
3 | 200002200001202110111112122 |
4 | 1022120212021223323031 |
5 | 1132222130143440121 |
6 | 14512132104142325 |
7 | 1035206323632401 |
oct | 112304611537315 |
9 | 20080052414478 |
10 | 5111651155661 |
11 | 16a09258a9326 |
12 | 6a68097679a5 |
13 | 2b104669834b |
14 | 139595d79101 |
15 | 8ce747705ab |
hex | 4a62626becd |
5111651155661 has 4 divisors (see below), whose sum is σ = 5123189872032. Its totient is φ = 5100112439292.
The previous prime is 5111651155627. The next prime is 5111651155691. The reversal of 5111651155661 is 1665511561115.
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 a de Polignac number, because none of the positive numbers 2k-5111651155661 is a prime.
It is a super-2 number, since 2×51116511556612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111651155691) 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, 5769357521 + ... + 5769358406.
It is an arithmetic number, because the mean of its divisors is an integer number (1280797468008).
Almost surely, 25111651155661 is an apocalyptic number.
It is an amenable number.
5111651155661 is a deficient number, since it is larger than the sum of its proper divisors (11538716371).
5111651155661 is a wasteful number, since it uses less digits than its factorization.
5111651155661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11538716370.
The product of its digits is 135000, while the sum is 44.
The spelling of 5111651155661 in words is "five trillion, one hundred eleven billion, six hundred fifty-one million, one hundred fifty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •