Search a number
-
+
56641015265 = 511328203053
BaseRepresentation
bin110100110000000100…
…010100110111100001
312102012102001200221012
4310300010110313201
51412000044442030
642004233310305
74043421454202
oct646004246741
9172172050835
1056641015265
112202641611a
12ab88b65395
135458895063
142a547215a9
1517178ed095
hexd30114de1

56641015265 has 4 divisors (see below), whose sum is σ = 67969218324. Its totient is φ = 45312812208.

The previous prime is 56641015219. The next prime is 56641015267. The reversal of 56641015265 is 56251014665.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56251014665 = 511250202933.

It can be written as a sum of positive squares in 2 ways, for example, as 34750925056 + 21890090209 = 186416^2 + 147953^2 .

It is a cyclic number.

It is not a de Polignac number, because 56641015265 - 220 = 56639966689 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (56641015267) 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, 5664101522 + ... + 5664101531.

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

Almost surely, 256641015265 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 11328203058.

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

The spelling of 56641015265 in words is "fifty-six billion, six hundred forty-one million, fifteen thousand, two hundred sixty-five".

Divisors: 1 5 11328203053 56641015265