Search a number
-
+
5061605033 is a prime number
BaseRepresentation
bin1001011011011000…
…11111011010101001
3111001202022011210002
410231230133122221
540331232330113
62154131432345
7236300634662
oct45554373251
914052264702
105061605033
112168164861
12b931556b5
1362884b284
1436033a369
151e9574c58
hex12db1f6a9

5061605033 has 2 divisors, whose sum is σ = 5061605034. Its totient is φ = 5061605032.

The previous prime is 5061604979. The next prime is 5061605039. The reversal of 5061605033 is 3305061605.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3937813504 + 1123791529 = 62752^2 + 33523^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 25061605033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 29.

The square root of 5061605033 is about 71144.9578888061. The cubic root of 5061605033 is about 1716.9701745117.

Adding to 5061605033 its reverse (3305061605), we get a palindrome (8366666638).

The spelling of 5061605033 in words is "five billion, sixty-one million, six hundred five thousand, thirty-three".