Search a number
-
+
128915028672011 is a prime number
BaseRepresentation
bin11101010011111101011110…
…011111010111111000001011
3121220110011020000001011022222
4131103331132133113320023
5113344120434320001021
61134102425133004255
736103542405451301
oct3523753637277013
9556404200034288
10128915028672011
1138092613971a2a
121256071a32368b
1356c183425465a
1423b9740a60271
15ed85981c26ab
hex753f5e7d7e0b

128915028672011 has 2 divisors, whose sum is σ = 128915028672012. Its totient is φ = 128915028672010.

The previous prime is 128915028671963. The next prime is 128915028672013. The reversal of 128915028672011 is 110276820519821.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 128915028672011 - 226 = 128914961563147 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2128915028672011 is an apocalyptic number.

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

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

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

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

The spelling of 128915028672011 in words is "one hundred twenty-eight trillion, nine hundred fifteen billion, twenty-eight million, six hundred seventy-two thousand, eleven".