Search a number
-
+
5050644641681 is a prime number
BaseRepresentation
bin100100101111111000111…
…1000010011011110010001
3122212211121002221111011212
41021133301320103132101
51130222210012013211
614424122322545505
71030616453053532
oct111376170233621
918784532844155
105050644641681
111677a6a259431
12696a22808295
132a8373560072
14136649960689
158b5a39a138b
hex497f1e13791

5050644641681 has 2 divisors, whose sum is σ = 5050644641682. Its totient is φ = 5050644641680.

The previous prime is 5050644641617. The next prime is 5050644641683. The reversal of 5050644641681 is 1861464460505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4564952730625 + 485691911056 = 2136575^2 + 696916^2 .

It is a cyclic number.

It is not a de Polignac number, because 5050644641681 - 26 = 5050644641617 is a prime.

It is a super-2 number, since 2×50506446416812 (a number of 26 digits) contains 22 as substring.

Together with 5050644641683, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 25050644641681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2764800, while the sum is 50.

The spelling of 5050644641681 in words is "five trillion, fifty billion, six hundred forty-four million, six hundred forty-one thousand, six hundred eighty-one".