Base | Representation |
---|---|
bin | 10101000000000100010100 |
3 | 101100200212000 |
4 | 111000010110 |
5 | 2402132200 |
6 | 313555300 |
7 | 64536303 |
oct | 25000424 |
9 | 11320760 |
10 | 5505300 |
11 | 3120239 |
12 | 1a15b30 |
13 | 11a9a98 |
14 | a3443a |
15 | 73b300 |
hex | 540114 |
5505300 has 72 divisors (see below), whose sum is σ = 17707200. Its totient is φ = 1467360.
The previous prime is 5505299. The next prime is 5505301. The reversal of 5505300 is 35055.
5505300 is nontrivially palindromic in base 14.
It is an interprime number because it is at equal distance from previous prime (5505299) and next prime (5505301).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5505301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1681 + ... + 3719.
Almost surely, 25505300 is an apocalyptic number.
5505300 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 5505300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8853600).
5505300 is an abundant number, since it is smaller than the sum of its proper divisors (12201900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5505300 is a wasteful number, since it uses less digits than its factorization.
5505300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2062 (or 2049 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 18.
The square root of 5505300 is about 2346.3375716209. The cubic root of 5505300 is about 176.5740980973.
The spelling of 5505300 in words is "five million, five hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •