Base | Representation |
---|---|
bin | 1010001111101010… |
… | …00100000101100000 |
3 | 112012022022222220221 |
4 | 11013311010011200 |
5 | 42231003410000 |
6 | 2305433212424 |
7 | 253203511231 |
oct | 50765040540 |
9 | 15168288827 |
10 | 5500060000 |
11 | 2372705536 |
12 | 1095b61114 |
13 | 698635096 |
14 | 3a2671088 |
15 | 222cd261a |
hex | 147d44160 |
5500060000 has 60 divisors (see below), whose sum is σ = 13531021812. Its totient is φ = 2200016000.
The previous prime is 5500059973. The next prime is 5500060051. The reversal of 5500060000 is 600055.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 117502 + ... + 157501.
Almost surely, 25500060000 is an apocalyptic number.
5500060000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5500060000 is an abundant number, since it is smaller than the sum of its proper divisors (8030961812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5500060000 is an equidigital number, since it uses as much as digits as its factorization.
5500060000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275033 (or 275010 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 16.
The square root of 5500060000 is about 74162.3893897709. The cubic root of 5500060000 is about 1765.1805864548.
Adding to 5500060000 its reverse (600055), we get a palindrome (5500660055).
It can be divided in two parts, 5 and 500060000, that added together give a palindrome (500060005).
The spelling of 5500060000 in words is "five billion, five hundred million, sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •