Base | Representation |
---|---|
bin | 1101100001010… |
… | …0000010000000 |
3 | 10221200220211211 |
4 | 3120110002000 |
5 | 104004031102 |
6 | 5343215504 |
7 | 1255662100 |
oct | 330240200 |
9 | 127626754 |
10 | 56705152 |
11 | 2a010469 |
12 | 16ba7594 |
13 | b99535a |
14 | 7761200 |
15 | 4ea17d7 |
hex | 3614080 |
56705152 has 48 divisors (see below), whose sum is σ = 131425470. Its totient is φ = 24299520.
The previous prime is 56705147. The next prime is 56705153. The reversal of 56705152 is 25150765.
It can be written as a sum of positive squares in only one way, i.e., 30735936 + 25969216 = 5544^2 + 5096^2 .
It is not an unprimeable number, because it can be changed into a prime (56705153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1752 + ... + 10792.
Almost surely, 256705152 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 56705152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65712735).
56705152 is an abundant number, since it is smaller than the sum of its proper divisors (74720318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56705152 is an equidigital number, since it uses as much as digits as its factorization.
56705152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9069 (or 9050 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 31.
The square root of 56705152 is about 7530.2823320245. The cubic root of 56705152 is about 384.1853850237.
The spelling of 56705152 in words is "fifty-six million, seven hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •