Search a number
-
+
6852608549 is a prime number
BaseRepresentation
bin1100110000111001…
…01000001000100101
3122200120101120201122
412120130220020211
5103013231433144
63051551103325
7331546132403
oct63034501045
918616346648
106852608549
1129a7134256
1213b2b11b45
1385290b477
14490150473
152a19027ee
hex198728225

6852608549 has 2 divisors, whose sum is σ = 6852608550. Its totient is φ = 6852608548.

The previous prime is 6852608501. The next prime is 6852608551. The reversal of 6852608549 is 9458062586.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4992411649 + 1860196900 = 70657^2 + 43130^2 .

It is a cyclic number.

It is not a de Polignac number, because 6852608549 - 216 = 6852543013 is a prime.

Together with 6852608551, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 26852608549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4147200, while the sum is 53.

The square root of 6852608549 is about 82780.4841070648. The cubic root of 6852608549 is about 1899.4096549136.

The spelling of 6852608549 in words is "six billion, eight hundred fifty-two million, six hundred eight thousand, five hundred forty-nine".