Base | Representation |
---|---|
bin | 1001010100101001… |
… | …00101001010111100 |
3 | 110220210210121211002 |
4 | 10222110211022330 |
5 | 40222240134000 |
6 | 2144350345432 |
7 | 235012562525 |
oct | 45224451274 |
9 | 13823717732 |
10 | 5005005500 |
11 | 2139216790 |
12 | b781bb278 |
13 | 619bc2021 |
14 | 356a0584c |
15 | 1e45e48d5 |
hex | 12a5252bc |
5005005500 has 96 divisors (see below), whose sum is σ = 12076646400. Its totient is φ = 1796808000.
The previous prime is 5005005497. The next prime is 5005005539. The reversal of 5005005500 is 55005005.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 428741 + ... + 440259.
It is an arithmetic number, because the mean of its divisors is an integer number (125798400).
Almost surely, 25005005500 is an apocalyptic number.
5005005500 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 5005005500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6038323200).
5005005500 is an abundant number, since it is smaller than the sum of its proper divisors (7071640900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5005005500 is a wasteful number, since it uses less digits than its factorization.
5005005500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11628 (or 11616 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 20.
The square root of 5005005500 is about 70746.0634947274. The cubic root of 5005005500 is about 1710.5463753404.
The spelling of 5005005500 in words is "five billion, five million, five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •