Search a number
-
+
49323303613261 is a prime number
BaseRepresentation
bin10110011011011111110011…
…11111011011001101001101
320110122021001211112002002101
423031233321333123031031
522431103111211111021
6252522451325155101
713250330305143046
oct1315577177331515
9213567054462071
1049323303613261
1114796994041007
12564722a6bba91
13216a224209812
14c273912658cd
155a802b88ba91
hex2cdbf9fdb34d

49323303613261 has 2 divisors, whose sum is σ = 49323303613262. Its totient is φ = 49323303613260.

The previous prime is 49323303613231. The next prime is 49323303613289. The reversal of 49323303613261 is 16231630332394.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 47633807975625 + 1689495637636 = 6901725^2 + 1299806^2 .

It is a cyclic number.

It is not a de Polignac number, because 49323303613261 - 211 = 49323303611213 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 249323303613261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1259712, while the sum is 46.

The spelling of 49323303613261 in words is "forty-nine trillion, three hundred twenty-three billion, three hundred three million, six hundred thirteen thousand, two hundred sixty-one".