Base | Representation |
---|---|
bin | 100101001011110010011… |
… | …0110010010000100100111 |
3 | 200002120020101212222002212 |
4 | 1022113210312102010213 |
5 | 1132212404210044431 |
6 | 14511431245354035 |
7 | 1035140221300643 |
oct | 112274466220447 |
9 | 20076211788085 |
10 | 5110555549991 |
11 | 16a04134155a1 |
12 | 6a656286891b |
13 | 2b0c006c5878 |
14 | 1394d0661c23 |
15 | 8ce0d4a672b |
hex | 4a5e4d92127 |
5110555549991 has 8 divisors (see below), whose sum is σ = 5116331888304. Its totient is φ = 5104779900480.
The previous prime is 5110555549903. The next prime is 5110555550003. The reversal of 5110555549991 is 1999455550115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5110555549991 - 222 = 5110551355687 is a prime.
It is a super-2 number, since 2×51105555499912 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5110555549991.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110555599991) 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, 15476081 + ... + 15802853.
It is an arithmetic number, because the mean of its divisors is an integer number (639541486038).
Almost surely, 25110555549991 is an apocalyptic number.
5110555549991 is a deficient number, since it is larger than the sum of its proper divisors (5776338313).
5110555549991 is a wasteful number, since it uses less digits than its factorization.
5110555549991 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344401.
The product of its (nonzero) digits is 9112500, while the sum is 59.
The spelling of 5110555549991 in words is "five trillion, one hundred ten billion, five hundred fifty-five million, five hundred forty-nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.847 sec. • engine limits •