Search a number
-
+
106315111 = 715187873
BaseRepresentation
bin1100101011000…
…11110101100111
321102001100220201
412111203311213
5204204040421
614314411331
72430443410
oct625436547
9242040821
10106315111
1155015131
122b730b47
1319045066
1410196807
159500b91
hex6563d67

106315111 has 4 divisors (see below), whose sum is σ = 121502992. Its totient is φ = 91127232.

The previous prime is 106315103. The next prime is 106315159. The reversal of 106315111 is 111513601.

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

It is not a de Polignac number, because 106315111 - 23 = 106315103 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2106315111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15187880.

The product of its (nonzero) digits is 90, while the sum is 19.

The square root of 106315111 is about 10310.9219277424. The cubic root of 106315111 is about 473.7308479853.

Adding to 106315111 its reverse (111513601), we get a palindrome (217828712).

The spelling of 106315111 in words is "one hundred six million, three hundred fifteen thousand, one hundred eleven".

Divisors: 1 7 15187873 106315111