Base | Representation |
---|---|
bin | 1101100100101… |
… | …0101110000000 |
3 | 10222010022010010 |
4 | 3121022232000 |
5 | 104033213102 |
6 | 5352104520 |
7 | 1260614130 |
oct | 331125600 |
9 | 128108103 |
10 | 56929152 |
11 | 2a153795 |
12 | 17095140 |
13 | ba432b7 |
14 | 77bcac0 |
15 | 4ee7d6c |
hex | 364ab80 |
56929152 has 64 divisors (see below), whose sum is σ = 172828800. Its totient is φ = 16264704.
The previous prime is 56929151. The next prime is 56929153. The reversal of 56929152 is 25192965.
It is an interprime number because it is at equal distance from previous prime (56929151) and next prime (56929153).
It is a tau number, because it is divible by the number of its divisors (64).
It is a self number, because there is not a number n which added to its sum of digits gives 56929152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56929151) 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 7 ways as a sum of consecutive naturals, for example, 7902 + ... + 13277.
It is an arithmetic number, because the mean of its divisors is an integer number (2700450).
Almost surely, 256929152 is an apocalyptic number.
It is an amenable number.
56929152 is an abundant number, since it is smaller than the sum of its proper divisors (115899648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56929152 is a wasteful number, since it uses less digits than its factorization.
56929152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21203 (or 21191 counting only the distinct ones).
The product of its digits is 48600, while the sum is 39.
The square root of 56929152 is about 7545.1409529577. The cubic root of 56929152 is about 384.6905975411.
The spelling of 56929152 in words is "fifty-six million, nine hundred twenty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •