Search a number
-
+
103950105953 is a prime number
BaseRepresentation
bin110000011001111101…
…0001011110101100001
3100221022110110111221012
41200303322023311201
53200342211342303
6115430511310305
710336660215251
oct1406372136541
9327273414835
10103950105953
11400a3141181
121819081b395
139a57cb2045
145061907961
152a85e065d8
hex1833e8bd61

103950105953 has 2 divisors, whose sum is σ = 103950105954. Its totient is φ = 103950105952.

The previous prime is 103950105937. The next prime is 103950105967. The reversal of 103950105953 is 359501059301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67261385104 + 36688720849 = 259348^2 + 191543^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 103950105953 - 24 = 103950105937 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 103950105953.

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

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

Almost surely, 2103950105953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 91125, while the sum is 41.

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