Base | Representation |
---|---|
bin | 1101010111100… |
… | …1101110110000 |
3 | 10220111210212211 |
4 | 3111321232300 |
5 | 103323320021 |
6 | 5321501504 |
7 | 1250420350 |
oct | 325715660 |
9 | 126453784 |
10 | 56073136 |
11 | 29719639 |
12 | 16941894 |
13 | b803792 |
14 | 7638b60 |
15 | 4dc93e1 |
hex | 3579bb0 |
56073136 has 40 divisors (see below), whose sum is σ = 125349120. Its totient is φ = 23801664.
The previous prime is 56073133. The next prime is 56073137. The reversal of 56073136 is 63137065.
It is a junction number, because it is equal to n+sod(n) for n = 56073098 and 56073107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56073131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9645 + ... + 14323.
It is an arithmetic number, because the mean of its divisors is an integer number (3133728).
Almost surely, 256073136 is an apocalyptic number.
56073136 is a gapful number since it is divisible by the number (56) 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 56073136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62674560).
56073136 is an abundant number, since it is smaller than the sum of its proper divisors (69275984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56073136 is a wasteful number, since it uses less digits than its factorization.
56073136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4801 (or 4795 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 31.
The square root of 56073136 is about 7488.1997836596. The cubic root of 56073136 is about 382.7527166428.
The spelling of 56073136 in words is "fifty-six million, seventy-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •