Base | Representation |
---|---|
bin | 1101100010011… |
… | …1010001010000 |
3 | 10221211220221100 |
4 | 3120213101100 |
5 | 104014041302 |
6 | 5345024400 |
7 | 1256440611 |
oct | 330472120 |
9 | 127756840 |
10 | 56783952 |
11 | 2a064695 |
12 | 17025100 |
13 | b9c2194 |
14 | 7781c08 |
15 | 4eb9d1c |
hex | 3627450 |
56783952 has 60 divisors (see below), whose sum is σ = 160864704. Its totient is φ = 18696000.
The previous prime is 56783929. The next prime is 56783959. The reversal of 56783952 is 25938765.
It is a happy number.
56783952 is a `hidden beast` number, since 567 + 8 + 39 + 52 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 56783898 and 56783907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56783959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9577 + ... + 14327.
Almost surely, 256783952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56783952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80432352).
56783952 is an abundant number, since it is smaller than the sum of its proper divisors (104080752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56783952 is a wasteful number, since it uses less digits than its factorization.
56783952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4848 (or 4839 counting only the distinct ones).
The product of its digits is 453600, while the sum is 45.
The square root of 56783952 is about 7535.5127230999. The cubic root of 56783952 is about 384.3632630166.
The spelling of 56783952 in words is "fifty-six million, seven hundred eighty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •