Base | Representation |
---|---|
bin | 10100011101111100111000 |
3 | 101002121011110 |
4 | 110131330320 |
5 | 2333144220 |
6 | 311000320 |
7 | 63415014 |
oct | 24357470 |
9 | 11077143 |
10 | 5365560 |
11 | 3035252 |
12 | 19690a0 |
13 | 115b2b5 |
14 | 9d9544 |
15 | 70ebe0 |
hex | 51df38 |
5365560 has 64 divisors (see below), whose sum is σ = 16382880. Its totient is φ = 1405440.
The previous prime is 5365559. The next prime is 5365631. The reversal of 5365560 is 655635.
It is a super-2 number, since 2×53655602 = 57578468227200, which contains 22 as substring.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6954 + ... + 7686.
Almost surely, 25365560 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 5365560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8191440).
5365560 is an abundant number, since it is smaller than the sum of its proper divisors (11017320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5365560 is a wasteful number, since it uses less digits than its factorization.
5365560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808 (or 804 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 30.
The square root of 5365560 is about 2316.3678464354. The cubic root of 5365560 is about 175.0672938476.
The spelling of 5365560 in words is "five million, three hundred sixty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •