Base | Representation |
---|---|
bin | 101000000001001000110… |
… | …0010111110110110000001 |
3 | 201110210110110100010012121 |
4 | 1100002101202332312001 |
5 | 1210103000000134010 |
6 | 15410355355524241 |
7 | 1105235061453535 |
oct | 120022142766601 |
9 | 21423413303177 |
10 | 5500000005505 |
11 | 183059a689105 |
12 | 749b2aa59681 |
13 | 30b8562146a5 |
14 | 1502b69abbc5 |
15 | 981033563da |
hex | 500918bed81 |
5500000005505 has 8 divisors (see below), whose sum is σ = 6600015802152. Its totient is φ = 4399989474048.
The previous prime is 5500000005491. The next prime is 5500000005541. The reversal of 5500000005505 is 5055000000055.
It can be written as a sum of positive squares in 4 ways, for example, as 1038509779329 + 4461490226176 = 1019073^2 + 2112224^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5500000005505 - 25 = 5500000005473 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5500000005505.
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 7 ways as a sum of consecutive naturals, for example, 1548727 + ... + 3660403.
It is an arithmetic number, because the mean of its divisors is an integer number (825001975269).
Almost surely, 25500000005505 is an apocalyptic number.
It is an amenable number.
5500000005505 is a deficient number, since it is larger than the sum of its proper divisors (1100015796647).
5500000005505 is a wasteful number, since it uses less digits than its factorization.
5500000005505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2632595.
The product of its (nonzero) digits is 3125, while the sum is 25.
The spelling of 5500000005505 in words is "five trillion, five hundred billion, five thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •