Base | Representation |
---|---|
bin | 1010010000010001… |
… | …00010110010100100 |
3 | 112012122221102201120 |
4 | 11020020202302210 |
5 | 42233310312000 |
6 | 2310134453540 |
7 | 253265100051 |
oct | 51010426244 |
9 | 15178842646 |
10 | 5505166500 |
11 | 2375583089 |
12 | 10978042b0 |
13 | 699702492 |
14 | 3a3200028 |
15 | 2234906a0 |
hex | 148222ca4 |
5505166500 has 96 divisors (see below), whose sum is σ = 16083954432. Its totient is φ = 1463200000.
The previous prime is 5505166493. The next prime is 5505166517. The reversal of 5505166500 is 56615055.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 460600 + ... + 472400.
It is an arithmetic number, because the mean of its divisors is an integer number (167541192).
Almost surely, 25505166500 is an apocalyptic number.
5505166500 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 5505166500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8041977216).
5505166500 is an abundant number, since it is smaller than the sum of its proper divisors (10578787932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5505166500 is a wasteful number, since it uses less digits than its factorization.
5505166500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12134 (or 12122 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The square root of 5505166500 is about 74196.8092305862. The cubic root of 5505166500 is about 1765.7267081620.
The spelling of 5505166500 in words is "five billion, five hundred five million, one hundred sixty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •