Base | Representation |
---|---|
bin | 1001011010101010… |
… | …01101000011010100 |
3 | 111001022211000221021 |
4 | 10231111031003110 |
5 | 40323202004000 |
6 | 2153352530524 |
7 | 236165021341 |
oct | 45525150324 |
9 | 14038730837 |
10 | 5055500500 |
11 | 2164775396 |
12 | b910b0a44 |
13 | 6274c181b |
14 | 35d5cb7c8 |
15 | 1e8c6b11a |
hex | 12d54d0d4 |
5055500500 has 24 divisors (see below), whose sum is σ = 11041214184. Its totient is φ = 2022200000.
The previous prime is 5055500459. The next prime is 5055500501. The reversal of 5055500500 is 50055505.
It can be written as a sum of positive squares in 4 ways, for example, as 86378436 + 4969122064 = 9294^2 + 70492^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055500501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5055001 + ... + 5056000.
It is an arithmetic number, because the mean of its divisors is an integer number (460050591).
Almost surely, 25055500500 is an apocalyptic number.
5055500500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5055500500 is an abundant number, since it is smaller than the sum of its proper divisors (5985713684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5055500500 is a wasteful number, since it uses less digits than its factorization.
5055500500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10111020 (or 10111008 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 25.
The square root of 5055500500 is about 71102.0428679795. The cubic root of 5055500500 is about 1716.2796479893.
The spelling of 5055500500 in words is "five billion, fifty-five million, five hundred thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •