Search a number
-
+
561016155065 = 5112203231013
BaseRepresentation
bin10000010100111110010…
…10110010101110111001
31222122002011212112200112
420022133022302232321
533142430113430230
61105421031114105
755350334431302
oct10123712625671
91878064775615
10561016155065
111a6a1aaa2933
129088b212935
1340b99280442
141d220a2b7a9
15e8d76a8d95
hex829f2b2bb9

561016155065 has 4 divisors (see below), whose sum is σ = 673219386084. Its totient is φ = 448812924048.

The previous prime is 561016155041. The next prime is 561016155067. The reversal of 561016155065 is 560551610165.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 305113721641 + 255902433424 = 552371^2 + 505868^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-561016155065 is a prime.

It is a super-2 number, since 2×5610161550652 (a number of 24 digits) contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (561016155067) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56101615502 + ... + 56101615511.

It is an arithmetic number, because the mean of its divisors is an integer number (168304846521).

Almost surely, 2561016155065 is an apocalyptic number.

It is an amenable number.

561016155065 is a deficient number, since it is larger than the sum of its proper divisors (112203231019).

561016155065 is a wasteful number, since it uses less digits than its factorization.

561016155065 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 112203231018.

The product of its (nonzero) digits is 135000, while the sum is 41.

The spelling of 561016155065 in words is "five hundred sixty-one billion, sixteen million, one hundred fifty-five thousand, sixty-five".

Divisors: 1 5 112203231013 561016155065