Search a number
-
+
5650510905673 is a prime number
BaseRepresentation
bin101001000111001110010…
…1100100000000101001001
3202000011221211011001100121
41102032130230200011021
51220034221242440143
620003450414503241
71122143633140624
oct122163454400511
922004854131317
105650510905673
1118894061090a7
12773134804b21
1331cac159442a
141576b4150dbb
159beb1c037ed
hex5239cb20149

5650510905673 has 2 divisors, whose sum is σ = 5650510905674. Its totient is φ = 5650510905672.

The previous prime is 5650510905617. The next prime is 5650510905719. The reversal of 5650510905673 is 3765090150565.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3732515808784 + 1917995096889 = 1931972^2 + 1384917^2 .

It is a cyclic number.

It is not a de Polignac number, because 5650510905673 - 29 = 5650510905161 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 5650510905673.

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

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

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

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

Almost surely, 25650510905673 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4252500, while the sum is 52.

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