Base | Representation |
---|---|
bin | 101000101111111101101… |
… | …1001000110111110000011 |
3 | 201211102000122210200010220 |
4 | 1101133323121012332003 |
5 | 1213224421333100201 |
6 | 15524510050354123 |
7 | 1115425045650141 |
oct | 121377331067603 |
9 | 21742018720126 |
10 | 5600560050051 |
11 | 186a203161a3a |
12 | 76551428b943 |
13 | 318190a70525 |
14 | 1550d6174591 |
15 | 9aa3b81a036 |
hex | 517fb646f83 |
5600560050051 has 32 divisors (see below), whose sum is σ = 7896856375296. Its totient is φ = 3524889984000.
The previous prime is 5600560050031. The next prime is 5600560050131. The reversal of 5600560050051 is 1500500650065.
It is not a de Polignac number, because 5600560050051 - 219 = 5600559525763 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5600560049994 and 5600560050021.
It is not an unprimeable number, because it can be changed into a prime (5600560050011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65567611 + ... + 65652971.
It is an arithmetic number, because the mean of its divisors is an integer number (246776761728).
Almost surely, 25600560050051 is an apocalyptic number.
5600560050051 is a deficient number, since it is larger than the sum of its proper divisors (2296296325245).
5600560050051 is a wasteful number, since it uses less digits than its factorization.
5600560050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102643.
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 5600560050051 in words is "five trillion, six hundred billion, five hundred sixty million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •