Base | Representation |
---|---|
bin | 1101011011010… |
… | …1011000000000 |
3 | 10220222020000010 |
4 | 3112311120000 |
5 | 103404124230 |
6 | 5331024520 |
7 | 1252455534 |
oct | 326653000 |
9 | 126866003 |
10 | 56317440 |
11 | 29876143 |
12 | 16a3b140 |
13 | b88aa3a |
14 | 769dbc4 |
15 | 4e269b0 |
hex | 35b5600 |
56317440 has 80 divisors (see below), whose sum is σ = 180064368. Its totient is φ = 15015936.
The previous prime is 56317433. The next prime is 56317451. The reversal of 56317440 is 4471365.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 56317398 and 56317407.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4014 + ... + 11346.
Almost surely, 256317440 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 56317440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90032184).
56317440 is an abundant number, since it is smaller than the sum of its proper divisors (123746928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56317440 is an equidigital number, since it uses as much as digits as its factorization.
56317440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7359 (or 7343 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 56317440 is about 7504.4946532062. The cubic root of 56317440 is about 383.3077806954.
The spelling of 56317440 in words is "fifty-six million, three hundred seventeen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •