Search a number
-
+
28915952711 is a prime number
BaseRepresentation
bin11010111011100001…
…100110110001000111
32202122012110121001112
4122323201212301013
5433204440441321
621141145115235
72042364354062
oct327341466107
982565417045
1028915952711
1111299335288
12572ba88b1b
13295a90b5b9
14158449d8d9
15b43894a5b
hex6bb866c47

28915952711 has 2 divisors, whose sum is σ = 28915952712. Its totient is φ = 28915952710.

The previous prime is 28915952707. The next prime is 28915952761. The reversal of 28915952711 is 11725951982.

It is an a-pointer prime, because the next prime (28915952761) can be obtained adding 28915952711 to its sum of digits (50).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 28915952711 - 22 = 28915952707 is a prime.

It is a super-2 number, since 2×289159527112 (a number of 22 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 228915952711 is an apocalyptic number.

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

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

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

The product of its digits is 453600, while the sum is 50.

The spelling of 28915952711 in words is "twenty-eight billion, nine hundred fifteen million, nine hundred fifty-two thousand, seven hundred eleven".