Base | Representation |
---|---|
bin | 10101010111101011010000 |
3 | 101112121111111 |
4 | 111113223100 |
5 | 2413231000 |
6 | 320023104 |
7 | 65421235 |
oct | 25275320 |
9 | 11477444 |
10 | 5602000 |
11 | 3186958 |
12 | 1a61a94 |
13 | 1211ac1 |
14 | a5b78c |
15 | 759cba |
hex | 557ad0 |
5602000 has 40 divisors (see below), whose sum is σ = 13550472. Its totient is φ = 2240000.
The previous prime is 5601943. The next prime is 5602001. The reversal of 5602000 is 2065.
It can be written as a sum of positive squares in 4 ways, for example, as 238144 + 5363856 = 488^2 + 2316^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5602001) 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, 600 + ... + 3400.
Almost surely, 25602000 is an apocalyptic number.
5602000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5602000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6775236).
5602000 is an abundant number, since it is smaller than the sum of its proper divisors (7948472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5602000 is a wasteful number, since it uses less digits than its factorization.
5602000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2824 (or 2808 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 13.
The square root of 5602000 is about 2366.8544526438. The cubic root of 5602000 is about 177.6019384038.
Adding to 5602000 its reverse (2065), we get a palindrome (5604065).
The spelling of 5602000 in words is "five million, six hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •