Search a number
-
+
103950301593673 is a prime number
BaseRepresentation
bin10111101000101011010000…
…110011010000000001001001
3111122001112220020200121100001
4113220223100303100001021
5102111110204201444143
61005030035335243001
730616106243520433
oct2750532063200111
9448045806617301
10103950301593673
11301380912a8567
12b7aa321819461
134600618809c52
141b953158cb653
15c03ebc60b14d
hex5e8ad0cd0049

103950301593673 has 2 divisors, whose sum is σ = 103950301593674. Its totient is φ = 103950301593672.

The previous prime is 103950301593583. The next prime is 103950301593701. The reversal of 103950301593673 is 376395103059301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97542249817104 + 6408051776569 = 9876348^2 + 2531413^2 .

It is a cyclic number.

It is not a de Polignac number, because 103950301593673 - 221 = 103950299496521 is a prime.

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

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

Almost surely, 2103950301593673 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6889050, while the sum is 55.

The spelling of 103950301593673 in words is "one hundred three trillion, nine hundred fifty billion, three hundred one million, five hundred ninety-three thousand, six hundred seventy-three".