Base | Representation |
---|---|
bin | 1110100011011011001… |
… | …10101001101011001010 |
3 | 1202210201200210210120110 |
4 | 13101231212221223022 |
5 | 31143103043230200 |
6 | 1021415551135150 |
7 | 51061554556605 |
oct | 7215546515312 |
9 | 1683650723513 |
10 | 500055055050 |
11 | 183088051141 |
12 | 80ab75144b6 |
13 | 38202686025 |
14 | 1a2ba67533c |
15 | d01a8aab50 |
hex | 746d9a9aca |
500055055050 has 96 divisors (see below), whose sum is σ = 1247327165952. Its totient is φ = 132576410880.
The previous prime is 500055055021. The next prime is 500055055117. The reversal of 500055055050 is 50550550005.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 500055054999 and 500055055017.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26650272 + ... + 26669028.
It is an arithmetic number, because the mean of its divisors is an integer number (12992991312).
Almost surely, 2500055055050 is an apocalyptic number.
500055055050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 500055055050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (623663582976).
500055055050 is an abundant number, since it is smaller than the sum of its proper divisors (747272110902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500055055050 is a wasteful number, since it uses less digits than its factorization.
500055055050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19792 (or 19787 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
The spelling of 500055055050 in words is "five hundred billion, fifty-five million, fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •