Base | Representation |
---|---|
bin | 1101010111000… |
… | …0111001111100 |
3 | 10220102222022000 |
4 | 3111300321330 |
5 | 103321140423 |
6 | 5321022300 |
7 | 1250210100 |
oct | 325607174 |
9 | 126388260 |
10 | 56036988 |
11 | 296a4467 |
12 | 16924990 |
13 | b7c01a7 |
14 | 7629900 |
15 | 4dbd843 |
hex | 3570e7c |
56036988 has 72 divisors (see below), whose sum is σ = 169016400. Its totient is φ = 16009056.
The previous prime is 56036983. The next prime is 56036989. The reversal of 56036988 is 88963065.
56036988 is a `hidden beast` number, since 560 + 3 + 6 + 9 + 88 = 666.
It is a super-2 number, since 2×560369882 = 6280288048224288, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56036983) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3 + ... + 10586.
It is an arithmetic number, because the mean of its divisors is an integer number (2347450).
Almost surely, 256036988 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 56036988, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84508200).
56036988 is an abundant number, since it is smaller than the sum of its proper divisors (112979412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56036988 is a wasteful number, since it uses less digits than its factorization.
56036988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10616 (or 10601 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 56036988 is about 7485.7857303025. The cubic root of 56036988 is about 382.6704507525.
The spelling of 56036988 in words is "fifty-six million, thirty-six thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •