Base | Representation |
---|---|
bin | 100101001011110000111… |
… | …0111100101100111110011 |
3 | 200002120002220211020111120 |
4 | 1022113201313211213303 |
5 | 1132212303410414223 |
6 | 14511422302113323 |
7 | 1035136043346114 |
oct | 112274167454763 |
9 | 20076086736446 |
10 | 5110505560563 |
11 | 16a0398181817 |
12 | 6a6549b7b843 |
13 | 2b0bc3242220 |
14 | 1394c7b6c20b |
15 | 8ce08dcebe3 |
hex | 4a5e1de59f3 |
5110505560563 has 8 divisors (see below), whose sum is σ = 7338161830608. Its totient is φ = 3144926498784.
The previous prime is 5110505560543. The next prime is 5110505560571. The reversal of 5110505560563 is 3650655050115.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5110505560563 - 228 = 5110237125107 is a prime.
It is a super-2 number, since 2×51105055605632 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (5110505560543) 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, 65519302020 + ... + 65519302097.
It is an arithmetic number, because the mean of its divisors is an integer number (917270228826).
Almost surely, 25110505560563 is an apocalyptic number.
5110505560563 is a deficient number, since it is larger than the sum of its proper divisors (2227656270045).
5110505560563 is a wasteful number, since it uses less digits than its factorization.
5110505560563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131038604133.
The product of its (nonzero) digits is 337500, while the sum is 42.
The spelling of 5110505560563 in words is "five trillion, one hundred ten billion, five hundred five million, five hundred sixty thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •