Base | Representation |
---|---|
bin | 10000010011001010111… |
… | …01110000011110110111 |
3 | 1222112120201012121112100 |
4 | 20021211131300132313 |
5 | 33133434300014210 |
6 | 1105141005153143 |
7 | 55314340602006 |
oct | 10114535603667 |
9 | 1875521177470 |
10 | 560048048055 |
11 | 1a65735827a1 |
12 | 9065ab5b7b3 |
13 | 40a7382ba62 |
14 | 1d16c222c3d |
15 | e87c6c75c0 |
hex | 82657707b7 |
560048048055 has 24 divisors (see below), whose sum is σ = 976173148080. Its totient is φ = 297023616000.
The previous prime is 560048048051. The next prime is 560048048057. The reversal of 560048048055 is 550840840065.
560048048055 is a `hidden beast` number, since 560 + 0 + 4 + 8 + 0 + 4 + 80 + 5 + 5 = 666.
It is not a de Polignac number, because 560048048055 - 22 = 560048048051 is a prime.
It is a super-2 number, since 2×5600480480552 (a number of 24 digits) 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 560048048055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (560048048051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34755946 + ... + 34772055.
It is an arithmetic number, because the mean of its divisors is an integer number (40673881170).
Almost surely, 2560048048055 is an apocalyptic number.
560048048055 is a deficient number, since it is larger than the sum of its proper divisors (416125100025).
560048048055 is a wasteful number, since it uses less digits than its factorization.
560048048055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69528191 (or 69528188 counting only the distinct ones).
The product of its (nonzero) digits is 768000, while the sum is 45.
The spelling of 560048048055 in words is "five hundred sixty billion, forty-eight million, forty-eight thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •