Search a number
-
+
5330256661 is a prime number
BaseRepresentation
bin1001111011011010…
…10100001100010101
3111202110211002112101
410331231110030111
541404021203121
62240525522101
7246042301612
oct47555241425
914673732471
105330256661
1122958777a4
121049113331
1366c3c1432
14387cad509
15212e40491
hex13db54315

5330256661 has 2 divisors, whose sum is σ = 5330256662. Its totient is φ = 5330256660.

The previous prime is 5330256649. The next prime is 5330256683. The reversal of 5330256661 is 1666520335.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4306640625 + 1023616036 = 65625^2 + 31994^2 .

It is a cyclic number.

It is not a de Polignac number, because 5330256661 - 25 = 5330256629 is a prime.

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

It is a congruent number.

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

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

Almost surely, 25330256661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 97200, while the sum is 37.

The square root of 5330256661 is about 73008.6067597513. The cubic root of 5330256661 is about 1746.8248997426.

Adding to 5330256661 its reverse (1666520335), we get a palindrome (6996776996).

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