Search a number
-
+
106415483 is a prime number
BaseRepresentation
bin1100101011111…
…00010101111011
321102020110121012
412111330111323
5204220243413
614320504135
72431342136
oct625742573
9242213535
10106415483
1155083589
122b77b04b
131907b955
14101c121d
1595207a8
hex657c57b

106415483 has 2 divisors, whose sum is σ = 106415484. Its totient is φ = 106415482.

The previous prime is 106415437. The next prime is 106415513. The reversal of 106415483 is 384514601.

It is a strong prime.

It is an emirp because it is prime and its reverse (384514601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 106415483 - 212 = 106411387 is a prime.

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

It is a Sophie Germain prime.

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

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 as a sum of consecutive naturals, namely, 53207741 + 53207742.

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

Almost surely, 2106415483 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 11520, while the sum is 32.

The square root of 106415483 is about 10315.7880455155. The cubic root of 106415483 is about 473.8798840484.

The spelling of 106415483 in words is "one hundred six million, four hundred fifteen thousand, four hundred eighty-three".