Base | Representation |
---|---|
bin | 1010010000001011… |
… | …10111110011100110 |
3 | 112012121121212000200 |
4 | 11020011313303212 |
5 | 42233120404100 |
6 | 2310111451330 |
7 | 253256122161 |
oct | 51005676346 |
9 | 15177555020 |
10 | 5504466150 |
11 | 2375144987 |
12 | 1097526b46 |
13 | 699518781 |
14 | 3a309aad8 |
15 | 2233a2e00 |
hex | 148177ce6 |
5504466150 has 144 divisors (see below), whose sum is σ = 15123526080. Its totient is φ = 1434931200.
The previous prime is 5504466119. The next prime is 5504466161. The reversal of 5504466150 is 516644055.
5504466150 is a `hidden beast` number, since 5 + 504 + 46 + 61 + 50 = 666.
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 71 ways as a sum of consecutive naturals, for example, 5297331 + ... + 5298369.
Almost surely, 25504466150 is an apocalyptic number.
5504466150 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 5504466150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7561763040).
5504466150 is an abundant number, since it is smaller than the sum of its proper divisors (9619059930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5504466150 is a wasteful number, since it uses less digits than its factorization.
5504466150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1311 (or 1303 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The square root of 5504466150 is about 74192.0895379015. The cubic root of 5504466150 is about 1765.6518282503.
The spelling of 5504466150 in words is "five billion, five hundred four million, four hundred sixty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •