Search a number
-
+
10561105005553 = 58271812442939
BaseRepresentation
bin1001100110101111001011…
…1010011000101111110001
31101101122001120021212110201
42121223302322120233301
52341013120340134203
634243412112355201
72140005012243124
oct231536272305761
941348046255421
1010561105005553
113401a374a2603
121226990845b01
135b7ba59475cb
142872358883bb
15134aba2ece1d
hex99af2e98bf1

10561105005553 has 4 divisors (see below), whose sum is σ = 10562917454320. Its totient is φ = 10559292556788.

The previous prime is 10561105005551. The next prime is 10561105005613. The reversal of 10561105005553 is 35550050116501.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10561105005553 - 21 = 10561105005551 is a prime.

It is a super-2 number, since 2×105611050055532 (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 (10561105005551) 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, 906215643 + ... + 906227296.

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

Almost surely, 210561105005553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1812448766.

The product of its (nonzero) digits is 56250, while the sum is 37.

The spelling of 10561105005553 in words is "ten trillion, five hundred sixty-one billion, one hundred five million, five thousand, five hundred fifty-three".

Divisors: 1 5827 1812442939 10561105005553