Search a number
-
+
103950105937 is a prime number
BaseRepresentation
bin110000011001111101…
…0001011110101010001
3100221022110110111220121
41200303322023311101
53200342211342222
6115430511310241
710336660215226
oct1406372136521
9327273414817
10103950105937
11400a3141167
121819081b381
139a57cb2032
14506190794d
152a85e065c7
hex1833e8bd51

103950105937 has 2 divisors, whose sum is σ = 103950105938. Its totient is φ = 103950105936.

The previous prime is 103950105899. The next prime is 103950105953. The reversal of 103950105937 is 739501059301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 57090412096 + 46859693841 = 238936^2 + 216471^2 .

It is a cyclic number.

It is not a de Polignac number, because 103950105937 - 219 = 103949581649 is a prime.

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

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

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

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

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

Almost surely, 2103950105937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 127575, while the sum is 43.

The spelling of 103950105937 in words is "one hundred three billion, nine hundred fifty million, one hundred five thousand, nine hundred thirty-seven".