Base | Representation |
---|---|
bin | 1101100101011… |
… | …1110010110100 |
3 | 10222020000120200 |
4 | 3121113302310 |
5 | 104041421313 |
6 | 5353200500 |
7 | 1261226226 |
oct | 331276264 |
9 | 128200520 |
10 | 56982708 |
11 | 2a18aa52 |
12 | 17100130 |
13 | ba617a3 |
14 | 77d4416 |
15 | 5008b73 |
hex | 3657cb4 |
56982708 has 54 divisors (see below), whose sum is σ = 153038886. Its totient is φ = 17873664.
The previous prime is 56982703. The next prime is 56982727. The reversal of 56982708 is 80728965.
56982708 is a `hidden beast` number, since 569 + 82 + 7 + 0 + 8 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 43718544 + 13264164 = 6612^2 + 3642^2 .
It is a super-2 number, since 2×569827082 = 6494058022026528, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56982703) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 7666 + ... + 13142.
Almost surely, 256982708 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 56982708, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76519443).
56982708 is an abundant number, since it is smaller than the sum of its proper divisors (96056178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56982708 is a wasteful number, since it uses less digits than its factorization.
56982708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5521 (or 5499 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The square root of 56982708 is about 7548.6891577280. The cubic root of 56982708 is about 384.8111920679.
The spelling of 56982708 in words is "fifty-six million, nine hundred eighty-two thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •