Search a number
-
+
103917641 is a prime number
BaseRepresentation
bin1100011000110…
…10100001001001
321020112120012112
412030122201021
5203100331031
614151152105
72401166612
oct614324111
9236476175
10103917641
1153727953
122a975635
13186b5a39
14db30c09
1591ca62b
hex631a849

103917641 has 2 divisors, whose sum is σ = 103917642. Its totient is φ = 103917640.

The previous prime is 103917629. The next prime is 103917647. The reversal of 103917641 is 146719301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 59228416 + 44689225 = 7696^2 + 6685^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-103917641 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 103917598 and 103917607.

It is not a weakly prime, because it can be changed into another prime (103917647) 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, 51958820 + 51958821.

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

Almost surely, 2103917641 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 103917641 is about 10194.0002452423. Note that the first 3 decimals coincide. The cubic root of 103917641 is about 470.1427678550.

The spelling of 103917641 in words is "one hundred three million, nine hundred seventeen thousand, six hundred forty-one".