Base | Representation |
---|---|
bin | 1001010100101001… |
… | …10001011000111110 |
3 | 110220210220011110210 |
4 | 10222110301120332 |
5 | 40222243234200 |
6 | 2144351413250 |
7 | 235013161455 |
oct | 45224613076 |
9 | 13823804423 |
10 | 5005055550 |
11 | 2139250350 |
12 | b78224226 |
13 | 619c0ba41 |
14 | 356a19b9c |
15 | 1e4604650 |
hex | 12a53163e |
5005055550 has 96 divisors (see below), whose sum is σ = 13770725760. Its totient is φ = 1192758400.
The previous prime is 5005055501. The next prime is 5005055603. The reversal of 5005055550 is 555505005.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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, 71644 + ... + 123056.
It is an arithmetic number, because the mean of its divisors is an integer number (143445060).
Almost surely, 25005055550 is an apocalyptic number.
5005055550 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 5005055550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6885362880).
5005055550 is an abundant number, since it is smaller than the sum of its proper divisors (8765670210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005055550 is a wasteful number, since it uses less digits than its factorization.
5005055550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51498 (or 51493 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
The square root of 5005055550 is about 70746.4172237718. The cubic root of 5005055550 is about 1710.5520771364.
The spelling of 5005055550 in words is "five billion, five million, fifty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •