Base | Representation |
---|---|
bin | 1101011111000… |
… | …0110100000101 |
3 | 10221102120222012 |
4 | 3113300310011 |
5 | 103434422101 |
6 | 5340144005 |
7 | 1254521405 |
oct | 327606405 |
9 | 127376865 |
10 | 56560901 |
11 | 29a22051 |
12 | 16b38005 |
13 | b9447b7 |
14 | 7724805 |
15 | 4e73bbb |
hex | 35f0d05 |
56560901 has 8 divisors (see below), whose sum is σ = 58203384. Its totient is φ = 54924480.
The previous prime is 56560883. The next prime is 56560913. The reversal of 56560901 is 10906565.
56560901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 15792676 + 40768225 = 3974^2 + 6385^2 .
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 56560901 - 218 = 56298757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56560951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22991 + ... + 25331.
It is an arithmetic number, because the mean of its divisors is an integer number (7275423).
Almost surely, 256560901 is an apocalyptic number.
It is an amenable number.
56560901 is a deficient number, since it is larger than the sum of its proper divisors (1642483).
56560901 is a wasteful number, since it uses less digits than its factorization.
56560901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3031.
The product of its (nonzero) digits is 8100, while the sum is 32.
The square root of 56560901 is about 7520.6981723773. The cubic root of 56560901 is about 383.8593347812.
The spelling of 56560901 in words is "fifty-six million, five hundred sixty thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •