Search a number
-
+
105521111 = 292125471
BaseRepresentation
bin1100100101000…
…01111111010111
321100120000202022
412102201333113
5204003133421
614245403355
72420625503
oct622417727
9240500668
10105521111
1154622633
122b40955b
1318b27837
141002b303
1593e57ab
hex64a1fd7

105521111 has 6 divisors (see below), whose sum is σ = 109286112. Its totient is φ = 101881640.

The previous prime is 105521093. The next prime is 105521161. The reversal of 105521111 is 111125501.

It is not a de Polignac number, because 105521111 - 210 = 105520087 is a prime.

It is a super-2 number, since 2×1055211112 = 22269409733348642, which contains 22 as substring.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 105521111.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61895 + ... + 63576.

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

Almost surely, 2105521111 is an apocalyptic number.

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

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

105521111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 125529 (or 125500 counting only the distinct ones).

The product of its (nonzero) digits is 50, while the sum is 17.

The square root of 105521111 is about 10272.3469080829. The cubic root of 105521111 is about 472.5485683024.

Adding to 105521111 its reverse (111125501), we get a palindrome (216646612).

The spelling of 105521111 in words is "one hundred five million, five hundred twenty-one thousand, one hundred eleven".

Divisors: 1 29 841 125471 3638659 105521111