Base | Representation |
---|---|
bin | 110100101110000000… |
… | …100100010101111001 |
3 | 12102010000001220110212 |
4 | 310232000210111321 |
5 | 1411412224210031 |
6 | 42001001120505 |
7 | 4042522050452 |
oct | 645600442571 |
9 | 172100056425 |
10 | 56606475641 |
11 | 22008974a81 |
12 | ab79489135 |
13 | 5451690a01 |
14 | 2a4dcd0129 |
15 | 171487912b |
hex | d2e024579 |
56606475641 has 4 divisors (see below), whose sum is σ = 56626558800. Its totient is φ = 56586392484.
The previous prime is 56606475529. The next prime is 56606475643. The reversal of 56606475641 is 14657460665.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14657460665 = 5 ⋅2931492133.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56606475641 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 56606475641.
It is not an unprimeable number, because it can be changed into a prime (56606475643) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10037351 + ... + 10042988.
It is an arithmetic number, because the mean of its divisors is an integer number (14156639700).
Almost surely, 256606475641 is an apocalyptic number.
It is an amenable number.
56606475641 is a deficient number, since it is larger than the sum of its proper divisors (20083159).
56606475641 is a wasteful number, since it uses less digits than its factorization.
56606475641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20083158.
The product of its (nonzero) digits is 3628800, while the sum is 50.
The spelling of 56606475641 in words is "fifty-six billion, six hundred six million, four hundred seventy-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •