Search a number
-
+
2987546669 is a prime number
BaseRepresentation
bin1011001000010010…
…0101100000101101
321201012121002120122
42302010211200231
522104302443134
61212241254325
7134014504412
oct26204454055
97635532518
102987546669
1112a3435038
126b46343a5
13387c440c3
14204ac4109
1512743402e
hexb212582d

2987546669 has 2 divisors, whose sum is σ = 2987546670. Its totient is φ = 2987546668.

The previous prime is 2987546651. The next prime is 2987546687. The reversal of 2987546669 is 9666457892.

It is a balanced prime because it is at equal distance from previous prime (2987546651) and next prime (2987546687).

It can be written as a sum of positive squares in only one way, i.e., 2436705769 + 550840900 = 49363^2 + 23470^2 .

It is a cyclic number.

It is not a de Polignac number, because 2987546669 - 220 = 2986498093 is a prime.

It is a super-2 number, since 2×29875466692 = 17850870198905991122, which contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 22987546669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 39191040, while the sum is 62.

The square root of 2987546669 is about 54658.4546890964. The cubic root of 2987546669 is about 1440.2511568415.

The spelling of 2987546669 in words is "two billion, nine hundred eighty-seven million, five hundred forty-six thousand, six hundred sixty-nine".