Base | Representation |
---|---|
bin | 10101010111111011111000 |
3 | 101112122221220 |
4 | 111113323320 |
5 | 2413244224 |
6 | 320032040 |
7 | 65424315 |
oct | 25277370 |
9 | 11478856 |
10 | 5603064 |
11 | 3187735 |
12 | 1a62620 |
13 | 121242c |
14 | a5bd0c |
15 | 75a279 |
hex | 557ef8 |
5603064 has 64 divisors (see below), whose sum is σ = 15344640. Its totient is φ = 1697280.
The previous prime is 5603063. The next prime is 5603069. The reversal of 5603064 is 4603065.
It is a super-3 number, since 3×56030643 (a number of 21 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5603063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12427 + ... + 12869.
It is an arithmetic number, because the mean of its divisors is an integer number (239760).
Almost surely, 25603064 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 5603064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7672320).
5603064 is an abundant number, since it is smaller than the sum of its proper divisors (9741576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5603064 is a wasteful number, since it uses less digits than its factorization.
5603064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500 (or 496 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 5603064 is about 2367.0792128697. The cubic root of 5603064 is about 177.6131817990.
Subtracting from 5603064 its reverse (4603065), we obtain a palindrome (999999).
The spelling of 5603064 in words is "five million, six hundred three thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •