Base | Representation |
---|---|
bin | 1101011100000… |
… | …0011100000000 |
3 | 10221001112011100 |
4 | 3113000130000 |
5 | 103412102002 |
6 | 5332014400 |
7 | 1253034615 |
oct | 327003400 |
9 | 127045140 |
10 | 56362752 |
11 | 298a7196 |
12 | 16a61400 |
13 | b8a5554 |
14 | 76b250c |
15 | 4e3511c |
hex | 35c0700 |
56362752 has 108 divisors (see below), whose sum is σ = 172186560. Its totient is φ = 17670144.
The previous prime is 56362751. The next prime is 56362781. The reversal of 56362752 is 25726365.
It is a happy number.
It is a super-3 number, since 3×563627523 (a number of 24 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56362751) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38449 + ... + 39887.
It is an arithmetic number, because the mean of its divisors is an integer number (1594320).
Almost surely, 256362752 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 56362752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86093280).
56362752 is an abundant number, since it is smaller than the sum of its proper divisors (115823808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56362752 is a wasteful number, since it uses less digits than its factorization.
56362752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1478 (or 1461 counting only the distinct ones).
The product of its digits is 75600, while the sum is 36.
The square root of 56362752 is about 7507.5130369517. The cubic root of 56362752 is about 383.4105539874.
The spelling of 56362752 in words is "fifty-six million, three hundred sixty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •