Base | Representation |
---|---|
bin | 1101011111010… |
… | …0000010110000 |
3 | 10221110021010002 |
4 | 3113310002300 |
5 | 103440333003 |
6 | 5340325132 |
7 | 1254605102 |
oct | 327640260 |
9 | 127407102 |
10 | 56574128 |
11 | 29a30a86 |
12 | 16b437a8 |
13 | b94a820 |
14 | 7729572 |
15 | 4e77a88 |
hex | 35f40b0 |
56574128 has 80 divisors (see below), whose sum is σ = 124679520. Its totient is φ = 24686592.
The previous prime is 56574103. The next prime is 56574131. The reversal of 56574128 is 82147565.
Its product of digits (67200) is a multiple of the sum of its prime divisors (240).
It is a junction number, because it is equal to n+sod(n) for n = 56574091 and 56574100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 500600 + ... + 500712.
It is an arithmetic number, because the mean of its divisors is an integer number (1558494).
Almost surely, 256574128 is an apocalyptic number.
56574128 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56574128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62339760).
56574128 is an abundant number, since it is smaller than the sum of its proper divisors (68105392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56574128 is a wasteful number, since it uses less digits than its factorization.
56574128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246 (or 240 counting only the distinct ones).
The product of its digits is 67200, while the sum is 38.
The square root of 56574128 is about 7521.5774941165. The cubic root of 56574128 is about 383.8892548120.
The spelling of 56574128 in words is "fifty-six million, five hundred seventy-four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •