Base | Representation |
---|---|
bin | 1110101100101111010… |
… | …10000001110000100100 |
3 | 1210021122012010021202122 |
4 | 13112113222001300210 |
5 | 31233323210104000 |
6 | 1024004101125112 |
7 | 51326514226544 |
oct | 7262752016044 |
9 | 1707565107678 |
10 | 505055550500 |
11 | 185213767406 |
12 | 81a720b9798 |
13 | 3881b659287 |
14 | 1a632825324 |
15 | d20e8ae085 |
hex | 7597a81c24 |
505055550500 has 72 divisors (see below), whose sum is σ = 1106361143160. Its totient is φ = 201416011200.
The previous prime is 505055550499. The next prime is 505055550533. The reversal of 505055550500 is 5055550505.
It can be written as a sum of positive squares in 4 ways, for example, as 23600164 + 505031950336 = 4858^2 + 710656^2 .
It is a super-2 number, since 2×5050555505002 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 60200306 + ... + 60208694.
Almost surely, 2505055550500 is an apocalyptic number.
505055550500 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 505055550500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (553180571580).
505055550500 is an abundant number, since it is smaller than the sum of its proper divisors (601305592660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505055550500 is an equidigital number, since it uses as much as digits as its factorization.
505055550500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9102 (or 8743 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 505055550500 in words is "five hundred five billion, fifty-five million, five hundred fifty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •