Base | Representation |
---|---|
bin | 10000010011000101001… |
… | …10101100111001110101 |
3 | 1222112110100220121201200 |
4 | 20021202212230321311 |
5 | 33133340003423140 |
6 | 1105132132443113 |
7 | 55313215660125 |
oct | 10114246547165 |
9 | 1875410817650 |
10 | 560000061045 |
11 | 1a6549487407 |
12 | 90646a79499 |
13 | 40a668c9989 |
14 | 1d165ad0c85 |
15 | e878399030 |
hex | 82629ace75 |
560000061045 has 24 divisors (see below), whose sum is σ = 996901012536. Its totient is φ = 290594625408.
The previous prime is 560000061041. The next prime is 560000061077. The reversal of 560000061045 is 540160000065.
It is a happy number.
560000061045 is a `hidden beast` number, since 5 + 6 + 0 + 0 + 0 + 0 + 0 + 610 + 45 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 155481164721 + 404518896324 = 394311^2 + 636018^2 .
It is not a de Polignac number, because 560000061045 - 22 = 560000061041 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (560000061041) 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 23 ways as a sum of consecutive naturals, for example, 168166522 + ... + 168169851.
It is an arithmetic number, because the mean of its divisors is an integer number (41537542189).
Almost surely, 2560000061045 is an apocalyptic number.
It is an amenable number.
560000061045 is a deficient number, since it is larger than the sum of its proper divisors (436900951491).
560000061045 is a wasteful number, since it uses less digits than its factorization.
560000061045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336336421 (or 336336418 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 560000061045 in words is "five hundred sixty billion, sixty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •