Search a number
-
+
511105511051 is a prime number
BaseRepresentation
bin1110111000000000100…
…00110010111010001011
31210212020211012010102122
413130000100302322023
531333221002323201
61030444300521455
751632446106522
oct7340020627213
91725224163378
10511105511051
11187838811303
128308025028b
1339273b984a5
141aa4811b4b9
15d465ab4e1b
hex7700432e8b

511105511051 has 2 divisors, whose sum is σ = 511105511052. Its totient is φ = 511105511050.

The previous prime is 511105510913. The next prime is 511105511053. The reversal of 511105511051 is 150115501115.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 511105511051 - 226 = 511038402187 is a prime.

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

Together with 511105511053, 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 511105511051.

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

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

Almost surely, 2511105511051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 625, while the sum is 26.

The spelling of 511105511051 in words is "five hundred eleven billion, one hundred five million, five hundred eleven thousand, fifty-one".