Search a number
-
+
49759956511901 is a prime number
BaseRepresentation
bin10110101000001101001001…
…00010000010110010011101
320112012000010220222121200122
423110012210202002302131
523010231342331340101
6253455224120204325
713324016052426626
oct1324064442026235
9215160126877618
1049759956511901
1114945096236679
1256b79909096a5
13219c46133615c
14c40575278a4d
155b4585eb351b
hex2d41a4882c9d

49759956511901 has 2 divisors, whose sum is σ = 49759956511902. Its totient is φ = 49759956511900.

The previous prime is 49759956511861. The next prime is 49759956511931. The reversal of 49759956511901 is 10911565995794.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 32937440983225 + 16822515528676 = 5739115^2 + 4101526^2 .

It is a cyclic number.

It is not a de Polignac number, because 49759956511901 - 222 = 49759952317597 is a prime.

It is a congruent number.

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

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

Almost surely, 249759956511901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 137781000, while the sum is 71.

The spelling of 49759956511901 in words is "forty-nine trillion, seven hundred fifty-nine billion, nine hundred fifty-six million, five hundred eleven thousand, nine hundred one".