Search a number
-
+
10561105005611 = 26340156292797
BaseRepresentation
bin1001100110101111001011…
…1010011000110000101011
31101101122001120021212112212
42121223302322120300223
52341013120340134421
634243412112355335
72140005012243236
oct231536272306053
941348046255485
1010561105005611
113401a374a2656
121226990845b4b
135b7ba5947644
1428723588841d
15134aba2ece5b
hex99af2e98c2b

10561105005611 has 4 divisors (see below), whose sum is σ = 10601261298672. Its totient is φ = 10520948712552.

The previous prime is 10561105005551. The next prime is 10561105005613. The reversal of 10561105005611 is 11650050116501.

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

It is a cyclic number.

It is not a de Polignac number, because 10561105005611 - 230 = 10560031263787 is a prime.

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

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210561105005611 is an apocalyptic number.

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

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

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

The sum of its prime factors is 40156293060.

The product of its (nonzero) digits is 4500, while the sum is 32.

The spelling of 10561105005611 in words is "ten trillion, five hundred sixty-one billion, one hundred five million, five thousand, six hundred eleven".

Divisors: 1 263 40156292797 10561105005611