Base | Representation |
---|---|
bin | 110001010101101… |
… | …1100001111101111 |
3 | 11021101012220120220 |
4 | 1202223130033233 |
5 | 11342310230210 |
6 | 432140142423 |
7 | 56011662060 |
oct | 14253341757 |
9 | 4241186526 |
10 | 1655555055 |
11 | 77a577020 |
12 | 3a2537a13 |
13 | 204cb779b |
14 | 119c36567 |
15 | 9a524c70 |
hex | 62adc3ef |
1655555055 has 64 divisors (see below), whose sum is σ = 3314912256. Its totient is φ = 685440000.
The previous prime is 1655555051. The next prime is 1655555137. The reversal of 1655555055 is 5505555561.
It is not a de Polignac number, because 1655555055 - 22 = 1655555051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1655554998 and 1655555016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1655555051) 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 63 ways as a sum of consecutive naturals, for example, 322005 + ... + 327105.
It is an arithmetic number, because the mean of its divisors is an integer number (51795504).
Almost surely, 21655555055 is an apocalyptic number.
1655555055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1655555055 is an abundant number, since it is smaller than the sum of its proper divisors (1659357201).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1655555055 is a wasteful number, since it uses less digits than its factorization.
1655555055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5408.
The product of its (nonzero) digits is 468750, while the sum is 42.
The square root of 1655555055 is about 40688.5125680455. The cubic root of 1655555055 is about 1182.9903697399.
The spelling of 1655555055 in words is "one billion, six hundred fifty-five million, five hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •