Base | Representation |
---|---|
bin | 1101011101111… |
… | …1111011100011 |
3 | 10221022002002221 |
4 | 3113133323203 |
5 | 103430213442 |
6 | 5334451511 |
7 | 1254112654 |
oct | 327377343 |
9 | 127262087 |
10 | 56491747 |
11 | 299850a4 |
12 | 16b03b97 |
13 | b91c190 |
14 | 770752b |
15 | 4e5d467 |
hex | 35dfee3 |
56491747 has 8 divisors (see below), whose sum is σ = 60999120. Its totient is φ = 52007520.
The previous prime is 56491741. The next prime is 56491753. The reversal of 56491747 is 74719465.
It is an interprime number because it is at equal distance from previous prime (56491741) and next prime (56491753).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56491747 is a prime.
It is a super-2 number, since 2×564917472 = 6382634958224018, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (56491741) 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, 529 + ... + 10642.
It is an arithmetic number, because the mean of its divisors is an integer number (7624890).
Almost surely, 256491747 is an apocalyptic number.
56491747 is a deficient number, since it is larger than the sum of its proper divisors (4507373).
56491747 is a wasteful number, since it uses less digits than its factorization.
56491747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11573.
The product of its digits is 211680, while the sum is 43.
The square root of 56491747 is about 7516.0991877436. The cubic root of 56491747 is about 383.7028295283.
It can be divided in two parts, 5649 and 1747, that added together give a square (7396 = 862).
The spelling of 56491747 in words is "fifty-six million, four hundred ninety-one thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •