Base | Representation |
---|---|
bin | 1101010111110… |
… | …1101001011000 |
3 | 10220112121212220 |
4 | 3111331221120 |
5 | 103324323201 |
6 | 5322104040 |
7 | 1250515203 |
oct | 325755130 |
9 | 126477786 |
10 | 56089176 |
11 | 2972a6a0 |
12 | 1694b020 |
13 | b80ab80 |
14 | 764093a |
15 | 4dce036 |
hex | 357da58 |
56089176 has 128 divisors (see below), whose sum is σ = 168134400. Its totient is φ = 15367680.
The previous prime is 56089153. The next prime is 56089177. The reversal of 56089176 is 67198065.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56089177) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 202350 + ... + 202626.
It is an arithmetic number, because the mean of its divisors is an integer number (1313550).
Almost surely, 256089176 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 56089176, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84067200).
56089176 is an abundant number, since it is smaller than the sum of its proper divisors (112045224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56089176 is a wasteful number, since it uses less digits than its factorization.
56089176 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 369 (or 365 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 42.
The square root of 56089176 is about 7489.2707255113. The cubic root of 56089176 is about 382.7892092708.
Subtracting 56089176 from its reverse (67198065), we obtain a square (11108889 = 33332).
It can be divided in two parts, 56089 and 176, that added together give a palindrome (56265).
The spelling of 56089176 in words is "fifty-six million, eighty-nine thousand, one hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •