Base | Representation |
---|---|
bin | 110100101110000111… |
… | …010011011010000111 |
3 | 12102010010101121111011 |
4 | 310232013103122013 |
5 | 1411413202210122 |
6 | 42001103023051 |
7 | 4042543053223 |
oct | 645607233207 |
9 | 172103347434 |
10 | 56608241287 |
11 | 22009970594 |
12 | ab79b9aa87 |
13 | 5451b5b580 |
14 | 2a5022d783 |
15 | 1714ac7377 |
hex | d2e1d3687 |
56608241287 has 8 divisors (see below), whose sum is σ = 61146903440. Its totient is φ = 52095890880.
The previous prime is 56608241281. The next prime is 56608241297. The reversal of 56608241287 is 78214280665.
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 56608241287 - 215 = 56608208519 is a prime.
It is a super-2 number, since 2×566082412872 (a number of 22 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 56608241287.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56608241281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6573462 + ... + 6582067.
It is an arithmetic number, because the mean of its divisors is an integer number (7643362930).
Almost surely, 256608241287 is an apocalyptic number.
56608241287 is a deficient number, since it is larger than the sum of its proper divisors (4538662153).
56608241287 is a wasteful number, since it uses less digits than its factorization.
56608241287 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13155873.
The product of its (nonzero) digits is 1290240, while the sum is 49.
The spelling of 56608241287 in words is "fifty-six billion, six hundred eight million, two hundred forty-one thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •