Search a number
-
+
4955494496801 is a prime number
BaseRepresentation
bin100100000011100101001…
…1111010011101000100001
3122112201222221011022102212
41020013022133103220201
51122142323042344201
614312304525051505
71021010526140402
oct110071237235041
918481887138385
104955494496801
1116406824aa262
126804a90b6b95
1329c3bb75c3a4
14131bc0a799a9
1588d85410abb
hex481ca7d3a21

4955494496801 has 2 divisors, whose sum is σ = 4955494496802. Its totient is φ = 4955494496800.

The previous prime is 4955494496779. The next prime is 4955494496809. The reversal of 4955494496801 is 1086944945594.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4127394496801 + 828100000000 = 2031599^2 + 910000^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-4955494496801 is a prime.

It is a super-3 number, since 3×49554944968013 (a number of 39 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 24955494496801 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 223948800, while the sum is 68.

The spelling of 4955494496801 in words is "four trillion, nine hundred fifty-five billion, four hundred ninety-four million, four hundred ninety-six thousand, eight hundred one".