Base | Representation |
---|---|
bin | 1110101101000001001… |
… | …00001000100100110100 |
3 | 1210022000121100010121211 |
4 | 13112200210020210310 |
5 | 31234124440004000 |
6 | 1024031000251204 |
7 | 51333310436044 |
oct | 7264044104464 |
9 | 1708017303554 |
10 | 505205000500 |
11 | 185290063402 |
12 | 81ab4170b04 |
13 | 388435c4a25 |
14 | 1a648609724 |
15 | d21ca807ba |
hex | 75a0908934 |
505205000500 has 96 divisors (see below), whose sum is σ = 1165449212928. Its totient is φ = 191014992000.
The previous prime is 505205000467. The next prime is 505205000501. The reversal of 505205000500 is 5000502505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505205000501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 287502 + ... + 1045498.
It is an arithmetic number, because the mean of its divisors is an integer number (12140095968).
Almost surely, 2505205000500 is an apocalyptic number.
505205000500 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 505205000500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (582724606464).
505205000500 is an abundant number, since it is smaller than the sum of its proper divisors (660244212428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505205000500 is a wasteful number, since it uses less digits than its factorization.
505205000500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 758090 (or 758078 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 22.
The spelling of 505205000500 in words is "five hundred five billion, two hundred five million, five hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •