Search a number
-
+
103023010130939 is a prime number
BaseRepresentation
bin10111011011001011101001…
…111011000010101111111011
3111111202220101201012120100122
4113123023221323002233323
5102000412111043142224
61003040041213123455
730462111142242233
oct2733135173025773
9444686351176318
10103023010130939
112a90a8a4461898
12b67a67178958b
134564049b71332
141b624a9ab2cc3
15bd9ce917515e
hex5db2e9ec2bfb

103023010130939 has 2 divisors, whose sum is σ = 103023010130940. Its totient is φ = 103023010130938.

The previous prime is 103023010130869. The next prime is 103023010131001. The reversal of 103023010130939 is 939031010320301.

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1030230101309392 (a number of 29 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2103023010130939 is an apocalyptic number.

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

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

103023010130939 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 13122, while the sum is 35.

The spelling of 103023010130939 in words is "one hundred three trillion, twenty-three billion, ten million, one hundred thirty thousand, nine hundred thirty-nine".