Base | Representation |
---|---|
bin | 1101011100100… |
… | …1001110100000 |
3 | 10221010100112200 |
4 | 3113021032200 |
5 | 103414230002 |
6 | 5332453200 |
7 | 1253244564 |
oct | 327111640 |
9 | 127110480 |
10 | 56398752 |
11 | 29921243 |
12 | 16a7a200 |
13 | b8b8a57 |
14 | 76c16a4 |
15 | 4e40b1c |
hex | 35c93a0 |
56398752 has 72 divisors (see below), whose sum is σ = 161896644. Its totient is φ = 18622464.
The previous prime is 56398733. The next prime is 56398763. The reversal of 56398752 is 25789365.
It is a happy number.
56398752 is a `hidden beast` number, since 5 + 639 + 8 + 7 + 5 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 49617936 + 6780816 = 7044^2 + 2604^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a junction number, because it is equal to n+sod(n) for n = 56398698 and 56398707.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31678 + ... + 33410.
Almost surely, 256398752 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 56398752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80948322).
56398752 is an abundant number, since it is smaller than the sum of its proper divisors (105497892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56398752 is a wasteful number, since it uses less digits than its factorization.
56398752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1862 (or 1851 counting only the distinct ones).
The product of its digits is 453600, while the sum is 45.
The square root of 56398752 is about 7509.9102524597. The cubic root of 56398752 is about 383.4921672385.
The spelling of 56398752 in words is "fifty-six million, three hundred ninety-eight thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •