Search a number
-
+
103680931 is a prime number
BaseRepresentation
bin1100010111000…
…00101110100011
321020002112111111
412023200232203
5203020242211
614142124151
72366162524
oct613405643
9236075444
10103680931
1153586022
122a880657
1318632083
14daac84b
159180421
hex62e0ba3

103680931 has 2 divisors, whose sum is σ = 103680932. Its totient is φ = 103680930.

The previous prime is 103680911. The next prime is 103680947. The reversal of 103680931 is 139086301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 103680931 - 215 = 103648163 is a prime.

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

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

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

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

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

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

Almost surely, 2103680931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 31.

The square root of 103680931 is about 10182.3833654012. The cubic root of 103680931 is about 469.7855230864.

The spelling of 103680931 in words is "one hundred three million, six hundred eighty thousand, nine hundred thirty-one".