Base | Representation |
---|---|
bin | 1101100100101… |
… | …0101101101000 |
3 | 10222010022002020 |
4 | 3121022231220 |
5 | 104033213003 |
6 | 5352104440 |
7 | 1260614064 |
oct | 331125550 |
9 | 128108066 |
10 | 56929128 |
11 | 2a153773 |
12 | 17095120 |
13 | ba43299 |
14 | 77bcaa4 |
15 | 4ee7d53 |
hex | 364ab68 |
56929128 has 32 divisors (see below), whose sum is σ = 142604160. Its totient is φ = 18938880.
The previous prime is 56929127. The next prime is 56929151. The reversal of 56929128 is 82192965.
56929128 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×569291282 = 6481851229680768, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56929128.
It is not an unprimeable number, because it can be changed into a prime (56929121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11793 + ... + 15903.
It is an arithmetic number, because the mean of its divisors is an integer number (4456380).
Almost surely, 256929128 is an apocalyptic number.
It is an amenable number.
56929128 is an abundant number, since it is smaller than the sum of its proper divisors (85675032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56929128 is a wasteful number, since it uses less digits than its factorization.
56929128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4697 (or 4693 counting only the distinct ones).
The product of its digits is 77760, while the sum is 42.
The square root of 56929128 is about 7545.1393625300. The cubic root of 56929128 is about 384.6905434823.
The spelling of 56929128 in words is "fifty-six million, nine hundred twenty-nine thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •