Base | Representation |
---|---|
bin | 1101100100101… |
… | …1101010110111 |
3 | 10222010111110101 |
4 | 3121023222313 |
5 | 104033324142 |
6 | 5352134531 |
7 | 1260631363 |
oct | 331135267 |
9 | 128114411 |
10 | 56933047 |
11 | 2a156706 |
12 | 17097447 |
13 | ba44cc2 |
14 | 77c02a3 |
15 | 4ee90b7 |
hex | 364bab7 |
56933047 has 4 divisors (see below), whose sum is σ = 58471816. Its totient is φ = 55394280.
The previous prime is 56933029. The next prime is 56933059. The reversal of 56933047 is 74033965.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74033965 = 5 ⋅14806793.
It is a cyclic number.
It is not a de Polignac number, because 56933047 - 211 = 56930999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 1538731 = 56933047 / (5 + 6 + 9 + 3 + 3 + 0 + 4 + 7).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56932997 and 56933015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56933087) 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, 769329 + ... + 769402.
It is an arithmetic number, because the mean of its divisors is an integer number (14617954).
Almost surely, 256933047 is an apocalyptic number.
56933047 is a deficient number, since it is larger than the sum of its proper divisors (1538769).
56933047 is a wasteful number, since it uses less digits than its factorization.
56933047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1538768.
The product of its (nonzero) digits is 68040, while the sum is 37.
The square root of 56933047 is about 7545.3990616799. The cubic root of 56933047 is about 384.6993706428.
The spelling of 56933047 in words is "fifty-six million, nine hundred thirty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.239 sec. • engine limits •