Search a number
-
+
6652046413 is a prime number
BaseRepresentation
bin1100011000111111…
…00010110001001101
3122011120222222012101
412030133202301031
5102110410441123
63020024235101
7323562314215
oct61437426115
918146888171
106652046413
1129039a7a21
12135790ba91
138201b834c
14471663245
1528ded6aad
hex18c7e2c4d

6652046413 has 2 divisors, whose sum is σ = 6652046414. Its totient is φ = 6652046412.

The previous prime is 6652046341. The next prime is 6652046459. The reversal of 6652046413 is 3146402566.

Together with previous prime (6652046341) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6643391049 + 8655364 = 81507^2 + 2942^2 .

It is a cyclic number.

It is not a de Polignac number, because 6652046413 - 217 = 6651915341 is a prime.

It is a congruent number.

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

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

Almost surely, 26652046413 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 6652046413 is about 81560.0785494963. The cubic root of 6652046413 is about 1880.6952322489.

Adding to 6652046413 its reverse (3146402566), we get a palindrome (9798448979).

The spelling of 6652046413 in words is "six billion, six hundred fifty-two million, forty-six thousand, four hundred thirteen".