Base | Representation |
---|---|
bin | 1001011011010000… |
… | …11101110101110000 |
3 | 111001200022120112210 |
4 | 10231220131311300 |
5 | 40331000100000 |
6 | 2154053052120 |
7 | 236255652042 |
oct | 45550356560 |
9 | 14050276483 |
10 | 5060550000 |
11 | 2167604130 |
12 | b92927040 |
13 | 62856bcac |
14 | 360143a92 |
15 | 1e9417350 |
hex | 12da1dd70 |
5060550000 has 240 divisors, whose sum is σ = 17831608704. Its totient is φ = 1226400000.
The previous prime is 5060549993. The next prime is 5060550013. The reversal of 5060550000 is 550605.
It is a tau number, because it is divible by the number of its divisors (240).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1648467 + ... + 1651533.
Almost surely, 25060550000 is an apocalyptic number.
5060550000 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 5060550000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8915804352).
5060550000 is an abundant number, since it is smaller than the sum of its proper divisors (12771058704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5060550000 is a wasteful number, since it uses less digits than its factorization.
5060550000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3114 (or 3088 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 21.
The square root of 5060550000 is about 71137.5428307726. The cubic root of 5060550000 is about 1716.8508720338.
The spelling of 5060550000 in words is "five billion, sixty million, five hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •