Search a number
-
+
106041557 is a prime number
BaseRepresentation
bin1100101001000…
…01000011010101
321101112110200002
412110201003111
5204121312212
614304501045
72425224026
oct624410325
9241473602
10106041557
1154948656
122b61a785
1318c7a6ab
1410124c4d
159499ac2
hex65210d5

106041557 has 2 divisors, whose sum is σ = 106041558. Its totient is φ = 106041556.

The previous prime is 106041511. The next prime is 106041577. The reversal of 106041557 is 755140601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 103510276 + 2531281 = 10174^2 + 1591^2 .

It is a cyclic number.

It is not a de Polignac number, because 106041557 - 28 = 106041301 is a prime.

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

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (106041577) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53020778 + 53020779.

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

Almost surely, 2106041557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 29.

The square root of 106041557 is about 10297.6481295488. The cubic root of 106041557 is about 473.3241880906.

The spelling of 106041557 in words is "one hundred six million, forty-one thousand, five hundred fifty-seven".