Base | Representation |
---|---|
bin | 1101011110110… |
… | …1001011111111 |
3 | 10221101211121001 |
4 | 3113231023333 |
5 | 103433433142 |
6 | 5335551131 |
7 | 1254430165 |
oct | 327551377 |
9 | 127354531 |
10 | 56546047 |
11 | 29a11978 |
12 | 16b2b4a7 |
13 | b93aacc |
14 | 771d235 |
15 | 4e6e5b7 |
hex | 35ed2ff |
56546047 has 4 divisors (see below), whose sum is σ = 56754976. Its totient is φ = 56337120.
The previous prime is 56546003. The next prime is 56546051. The reversal of 56546047 is 74064565.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56546047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56545997 and 56546015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56546647) 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 3 ways as a sum of consecutive naturals, for example, 104058 + ... + 104599.
It is an arithmetic number, because the mean of its divisors is an integer number (14188744).
Almost surely, 256546047 is an apocalyptic number.
56546047 is a deficient number, since it is larger than the sum of its proper divisors (208929).
56546047 is a wasteful number, since it uses less digits than its factorization.
56546047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208928.
The product of its (nonzero) digits is 100800, while the sum is 37.
The square root of 56546047 is about 7519.7105662386. The cubic root of 56546047 is about 383.8257288469.
The spelling of 56546047 in words is "fifty-six million, five hundred forty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •