Base | Representation |
---|---|
bin | 101000101111111100000… |
… | …1001011010101111000101 |
3 | 201211101212212100120122210 |
4 | 1101133320021122233011 |
5 | 1213224313413330221 |
6 | 15524500423414033 |
7 | 1115423515120323 |
oct | 121377011325705 |
9 | 21741785316583 |
10 | 5600505605061 |
11 | 186a185455684 |
12 | 7654b9bb4319 |
13 | 3181826b9b63 |
14 | 1550ccc40d13 |
15 | 9aa36b63276 |
hex | 517f825abc5 |
5600505605061 has 32 divisors (see below), whose sum is σ = 7921226400768. Its totient is φ = 3513499269120.
The previous prime is 5600505605047. The next prime is 5600505605087. The reversal of 5600505605061 is 1605065050065.
It is not a de Polignac number, because 5600505605061 - 27 = 5600505604933 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5600505605021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5359831 + ... + 6318923.
It is an arithmetic number, because the mean of its divisors is an integer number (247538325024).
Almost surely, 25600505605061 is an apocalyptic number.
It is an amenable number.
5600505605061 is a deficient number, since it is larger than the sum of its proper divisors (2320720795707).
5600505605061 is a wasteful number, since it uses less digits than its factorization.
5600505605061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 960861.
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 5600505605061 in words is "five trillion, six hundred billion, five hundred five million, six hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •