Search a number
-
+
6902143561 is a prime number
BaseRepresentation
bin1100110110110011…
…00101101001001001
3122211000121012222201
412123121211221021
5103113422043221
63100520520201
7333020152345
oct63331455111
918730535881
106902143561
112a22097685
121407620061
1385cc63021
14496966625
152a5e39891
hex19b665a49

6902143561 has 2 divisors, whose sum is σ = 6902143562. Its totient is φ = 6902143560.

The previous prime is 6902143537. The next prime is 6902143571. The reversal of 6902143561 is 1653412096.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6672439225 + 229704336 = 81685^2 + 15156^2 .

It is a cyclic number.

It is not a de Polignac number, because 6902143561 - 25 = 6902143529 is a prime.

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

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

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

Almost surely, 26902143561 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 6902143561 is about 83079.1403482246. The cubic root of 6902143561 is about 1903.9753847807.

The spelling of 6902143561 in words is "six billion, nine hundred two million, one hundred forty-three thousand, five hundred sixty-one".