Base | Representation |
---|---|
bin | 101000000011101100101… |
… | …1001111001010101010101 |
3 | 201111022122210120202101202 |
4 | 1100013121121321111111 |
5 | 1210200231120103420 |
6 | 15413105251402245 |
7 | 1105521302355035 |
oct | 120073131712525 |
9 | 21438583522352 |
10 | 5505500550485 |
11 | 1832962594a51 |
12 | 74b004bb3385 |
13 | 30c221989430 |
14 | 1506793278c5 |
15 | 983261d2575 |
hex | 501d9679555 |
5505500550485 has 64 divisors (see below), whose sum is σ = 7298525364480. Its totient is φ = 3961966970880.
The previous prime is 5505500550463. The next prime is 5505500550493. The reversal of 5505500550485 is 5840550055055.
It is a de Polignac number, because none of the positive numbers 2k-5505500550485 is a prime.
It is a super-2 number, since 2×55055005504852 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 284086526 + ... + 284105904.
It is an arithmetic number, because the mean of its divisors is an integer number (114039458820).
Almost surely, 25505500550485 is an apocalyptic number.
It is an amenable number.
5505500550485 is a deficient number, since it is larger than the sum of its proper divisors (1793024813995).
5505500550485 is a wasteful number, since it uses less digits than its factorization.
5505500550485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20118.
The product of its (nonzero) digits is 2500000, while the sum is 47.
The spelling of 5505500550485 in words is "five trillion, five hundred five billion, five hundred million, five hundred fifty thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •