Base | Representation |
---|---|
bin | 1001010100010101… |
… | …11010000010101110 |
3 | 110220122000210011000 |
4 | 10222022322002232 |
5 | 40221113011200 |
6 | 2144220141130 |
7 | 234652201221 |
oct | 45212720256 |
9 | 13818023130 |
10 | 5002469550 |
11 | 2137844461 |
12 | b773977a6 |
13 | 619514970 |
14 | 3565455b8 |
15 | 1e4293300 |
hex | 12a2ba0ae |
5002469550 has 192 divisors, whose sum is σ = 15358392000. Its totient is φ = 1188794880.
The previous prime is 5002469509. The next prime is 5002469561. The reversal of 5002469550 is 559642005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 504036 + ... + 513864.
It is an arithmetic number, because the mean of its divisors is an integer number (79991625).
Almost surely, 25002469550 is an apocalyptic number.
5002469550 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 5002469550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7679196000).
5002469550 is an abundant number, since it is smaller than the sum of its proper divisors (10355922450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5002469550 is a wasteful number, since it uses less digits than its factorization.
5002469550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9892 (or 9881 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 5002469550 is about 70728.1383184939. The cubic root of 5002469550 is about 1710.2574250801.
It can be divided in two parts, 500246 and 9550, that added together give a square (509796 = 7142).
The spelling of 5002469550 in words is "five billion, two million, four hundred sixty-nine thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •