Search a number
-
+
106915495 = 541521539
BaseRepresentation
bin1100101111101…
…10011010100111
321110011212111011
412113312122213
5204332243440
614335323051
72435523661
oct627663247
9243155434
10106915495
1155395215
122b980487
13191c540b
14102b1531
1595bd9ea
hex65f66a7

106915495 has 8 divisors (see below), whose sum is σ = 131428080. Its totient is φ = 83446080.

The previous prime is 106915481. The next prime is 106915531. The reversal of 106915495 is 594519601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 106915495 - 211 = 106913447 is a prime.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 260565 + ... + 260974.

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

Almost surely, 2106915495 is an apocalyptic number.

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

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

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

The sum of its prime factors is 521585.

The product of its (nonzero) digits is 48600, while the sum is 40.

The square root of 106915495 is about 10339.9949226293. The cubic root of 106915495 is about 474.6209274795.

It can be divided in two parts, 106915 and 495, that multiplied together give a palindrome (52922925).

The spelling of 106915495 in words is "one hundred six million, nine hundred fifteen thousand, four hundred ninety-five".

Divisors: 1 5 41 205 521539 2607695 21383099 106915495