Base | Representation |
---|---|
bin | 1101100000010… |
… | …0101001100000 |
3 | 10221120201102012 |
4 | 3120010221200 |
5 | 104000022034 |
6 | 5342012052 |
7 | 1255310306 |
oct | 330045140 |
9 | 127521365 |
10 | 56642144 |
11 | 29a78099 |
12 | 16b77028 |
13 | b972780 |
14 | 7746276 |
15 | 4e8ccce |
hex | 3604a60 |
56642144 has 48 divisors (see below), whose sum is σ = 122689728. Its totient is φ = 25577472.
The previous prime is 56642143. The next prime is 56642149. The reversal of 56642144 is 44124665.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 56642144.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56642141) 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, 18104 + ... + 21000.
It is an arithmetic number, because the mean of its divisors is an integer number (2556036).
Almost surely, 256642144 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 56642144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61344864).
56642144 is an abundant number, since it is smaller than the sum of its proper divisors (66047584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56642144 is a wasteful number, since it uses less digits than its factorization.
56642144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2967 (or 2959 counting only the distinct ones).
The product of its digits is 23040, while the sum is 32.
The square root of 56642144 is about 7526.0975279357. The cubic root of 56642144 is about 384.0430362646.
The spelling of 56642144 in words is "fifty-six million, six hundred forty-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •