Base | Representation |
---|---|
bin | 1010010111100101… |
… | …00100111100111111 |
3 | 112100221101100212100 |
4 | 11023302210330333 |
5 | 42400012021210 |
6 | 2320205440143 |
7 | 254641420461 |
oct | 51362447477 |
9 | 15327340770 |
10 | 5566517055 |
11 | 23a7176720 |
12 | 10b4270053 |
13 | 6a9333098 |
14 | 3ab410131 |
15 | 228a5d5c0 |
hex | 14bca4f3f |
5566517055 has 48 divisors (see below), whose sum is σ = 10770604416. Its totient is φ = 2636141760.
The previous prime is 5566517041. The next prime is 5566517083. The reversal of 5566517055 is 5507156655.
It is not a de Polignac number, because 5566517055 - 210 = 5566516031 is a prime.
It is a super-2 number, since 2×55665170552 = 61972224247211746050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5566517055.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 109477 + ... + 152046.
It is an arithmetic number, because the mean of its divisors is an integer number (224387592).
Almost surely, 25566517055 is an apocalyptic number.
5566517055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5566517055 is a deficient number, since it is larger than the sum of its proper divisors (5204087361).
5566517055 is a wasteful number, since it uses less digits than its factorization.
5566517055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261588 (or 261585 counting only the distinct ones).
The product of its (nonzero) digits is 787500, while the sum is 45.
The square root of 5566517055 is about 74609.0949884798. The cubic root of 5566517055 is about 1772.2616831755.
The spelling of 5566517055 in words is "five billion, five hundred sixty-six million, five hundred seventeen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •