Search a number
-
+
5650611047 is a prime number
BaseRepresentation
bin1010100001100110…
…10111101101100111
3112120210121210010122
411100303113231213
543033024023142
62332412112155
7260012254454
oct52063275547
915523553118
105650611047
11243a693794
12111846565b
136c0897a43
143b866082b
152311201d2
hex150cd7b67

5650611047 has 2 divisors, whose sum is σ = 5650611048. Its totient is φ = 5650611046.

The previous prime is 5650611023. The next prime is 5650611061. The reversal of 5650611047 is 7401160565.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5650611047 - 218 = 5650348903 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 5650610998 and 5650611016.

It is a congruent number.

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

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

Almost surely, 25650611047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 35.

The square root of 5650611047 is about 75170.5464061556. The cubic root of 5650611047 is about 1781.1416997998.

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