Base | Representation |
---|---|
bin | 101000011101100000011… |
… | …1110011000100001010000 |
3 | 201200121201102221201022111 |
4 | 1100323000332120201100 |
5 | 1212102233331303411 |
6 | 15454353115315104 |
7 | 1112522624542021 |
oct | 120730076304120 |
9 | 21617642851274 |
10 | 5560925259856 |
11 | 185441437748a |
12 | 7598b274ba94 |
13 | 31451556b155 |
14 | 1532162b2c48 |
15 | 999bbe23721 |
hex | 50ec0f98850 |
5560925259856 has 20 divisors (see below), whose sum is σ = 10797868837972. Its totient is φ = 2774378462976.
The previous prime is 5560925259833. The next prime is 5560925259859. The reversal of 5560925259856 is 6589525290655.
It can be written as a sum of positive squares in 2 ways, for example, as 4445704778256 + 1115220481600 = 2108484^2 + 1056040^2 .
It is a super-2 number, since 2×55609252598562 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5560925259791 and 5560925259800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5560925259859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 380252895 + ... + 380267518.
Almost surely, 25560925259856 is an apocalyptic number.
It is an amenable number.
5560925259856 is a deficient number, since it is larger than the sum of its proper divisors (5236943578116).
5560925259856 is a wasteful number, since it uses less digits than its factorization.
5560925259856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760520878 (or 760520872 counting only the distinct ones).
The product of its (nonzero) digits is 291600000, while the sum is 67.
The spelling of 5560925259856 in words is "five trillion, five hundred sixty billion, nine hundred twenty-five million, two hundred fifty-nine thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •