Base | Representation |
---|---|
bin | 1010001111101111… |
… | …01011011100100001 |
3 | 112012100121211021000 |
4 | 11013313223130201 |
5 | 42231142324010 |
6 | 2305500022213 |
7 | 253212364623 |
oct | 50767533441 |
9 | 15170554230 |
10 | 5500745505 |
11 | 2373033572 |
12 | 1096231969 |
13 | 6988150c8 |
14 | 3a27acc13 |
15 | 222dba7c0 |
hex | 147deb721 |
5500745505 has 32 divisors (see below), whose sum is σ = 10354348800. Its totient is φ = 2761157376.
The previous prime is 5500745501. The next prime is 5500745507. The reversal of 5500745505 is 5055470055.
It is a happy number.
It is not a de Polignac number, because 5500745505 - 22 = 5500745501 is a prime.
It is a super-2 number, since 2×55007455052 = 60516402221555410050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5500745505.
It is not an unprimeable number, because it can be changed into a prime (5500745501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1196125 + ... + 1200714.
It is an arithmetic number, because the mean of its divisors is an integer number (323573400).
Almost surely, 25500745505 is an apocalyptic number.
It is an amenable number.
5500745505 is a deficient number, since it is larger than the sum of its proper divisors (4853603295).
5500745505 is a wasteful number, since it uses less digits than its factorization.
5500745505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2396870 (or 2396864 counting only the distinct ones).
The product of its (nonzero) digits is 87500, while the sum is 36.
The square root of 5500745505 is about 74167.0108943323. The cubic root of 5500745505 is about 1765.2539183730.
The spelling of 5500745505 in words is "five billion, five hundred million, seven hundred forty-five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •