Base | Representation |
---|---|
bin | 11110000110011… |
… | …100001100000000 |
3 | 1022012020220100111 |
4 | 132012130030000 |
5 | 2013240123200 |
6 | 122040001104 |
7 | 15341320126 |
oct | 3606341400 |
9 | 1265226314 |
10 | 505004800 |
11 | 23a075643 |
12 | 121160194 |
13 | 80818111 |
14 | 4b0d9916 |
15 | 2e5060ba |
hex | 1e19c300 |
505004800 has 108 divisors (see below), whose sum is σ = 1316070280. Its totient is φ = 191324160.
The previous prime is 505004791. The next prime is 505004803. The reversal of 505004800 is 8400505.
It is a happy number.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (505004803) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 119524 + ... + 123676.
Almost surely, 2505004800 is an apocalyptic number.
505004800 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 505004800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (658035140).
505004800 is an abundant number, since it is smaller than the sum of its proper divisors (811065480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505004800 is a wasteful number, since it uses less digits than its factorization.
505004800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4198 (or 4179 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 505004800 is about 22472.3118525887. The cubic root of 505004800 is about 796.3399472202.
The spelling of 505004800 in words is "five hundred five million, four thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •