Search a number
-
+
10561050110 = 251381238847
BaseRepresentation
bin10011101010111110…
…01101010111111110
31000021000110221012002
421311133031113332
5133112112100420
64503543542302
7522466305362
oct116537152776
930230427162
1010561050110
11452a48a296
122068a5a992
13cc3cc94a0
1472288b2a2
1541c285075
hex2757cd5fe

10561050110 has 16 divisors (see below), whose sum is σ = 20472189696. Its totient is φ = 3899464608.

The previous prime is 10561050043. The next prime is 10561050113. The reversal of 10561050110 is 1105016501.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10561050113) 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 7 ways as a sum of consecutive naturals, for example, 40619294 + ... + 40619553.

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

Almost surely, 210561050110 is an apocalyptic number.

10561050110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 81238867.

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 10561050110 its reverse (1105016501), we get a palindrome (11666066611).

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

Divisors: 1 2 5 10 13 26 65 130 81238847 162477694 406194235 812388470 1056105011 2112210022 5280525055 10561050110