Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …00001110111100000101001 |
3 | 21012221012201111000010201012 |
4 | 30201022001001313200221 |
5 | 24204010223210104010 |
6 | 313031535433233305 |
7 | 14411411412556313 |
oct | 1441120101674051 |
9 | 235835644003635 |
10 | 55055055550505 |
11 | 165a679963760a |
12 | 6212056862835 |
13 | 2494891a6545a |
14 | d84970cc27b3 |
15 | 6571959a2005 |
hex | 321281077829 |
55055055550505 has 8 divisors (see below), whose sum is σ = 66067293586824. Its totient is φ = 44043226489600.
The previous prime is 55055055550501. The next prime is 55055055550507. The reversal of 55055055550505 is 50505555055055.
It can be written as a sum of positive squares in 4 ways, for example, as 2584387405609 + 52470668144896 = 1607603^2 + 7243664^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55055055550505 - 22 = 55055055550501 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55055055550501) by changing a digit.
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, 101947616 + ... + 102486225.
It is an arithmetic number, because the mean of its divisors is an integer number (8258411698353).
Almost surely, 255055055550505 is an apocalyptic number.
It is an amenable number.
55055055550505 is a deficient number, since it is larger than the sum of its proper divisors (11012238036319).
55055055550505 is a wasteful number, since it uses less digits than its factorization.
55055055550505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204487707.
The product of its (nonzero) digits is 9765625, while the sum is 50.
The spelling of 55055055550505 in words is "fifty-five trillion, fifty-five billion, fifty-five million, five hundred fifty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •