Search a number
-
+
10536761057 = 66115940637
BaseRepresentation
bin10011101000000101…
…00011011011100001
31000012022202220212112
421310002203123201
5133034402323212
64501315205105
7522052663664
oct116402433341
930168686775
1010536761057
1145177aa599
1220608a6795
13cbbc73a74
1471d5676db
1541a088422
hex2740a36e1

10536761057 has 4 divisors (see below), whose sum is σ = 10552702356. Its totient is φ = 10520819760.

The previous prime is 10536761029. The next prime is 10536761063. The reversal of 10536761057 is 75016763501.

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

It can be written as a sum of positive squares in 2 ways, for example, as 9658172176 + 878588881 = 98276^2 + 29641^2 .

It is a cyclic number.

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

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

It is a Duffinian number.

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

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

Almost surely, 210536761057 is an apocalyptic number.

It is an amenable number.

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

10536761057 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 15941298.

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

The spelling of 10536761057 in words is "ten billion, five hundred thirty-six million, seven hundred sixty-one thousand, fifty-seven".

Divisors: 1 661 15940637 10536761057