Search a number
-
+
511969196941 is a prime number
BaseRepresentation
bin1110111001100111011…
…11011111101110001101
31210221111000100220201221
413130303233133232031
531342003103300231
61031110112403341
751663034241266
oct7346357375615
91727430326657
10511969196941
111881412a02a4
1283281546551
1339380ab8c27
141aacab0396d
15d4b681bd11
hex7733bdfb8d

511969196941 has 2 divisors, whose sum is σ = 511969196942. Its totient is φ = 511969196940.

The previous prime is 511969196927. The next prime is 511969196953. The reversal of 511969196941 is 149691969115.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 487419007716 + 24550189225 = 698154^2 + 156685^2 .

It is a cyclic number.

It is not a de Polignac number, because 511969196941 - 29 = 511969196429 is a prime.

It is a super-2 number, since 2×5119691969412 (a number of 24 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 511969196941.

It is a congruent number.

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

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

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

Almost surely, 2511969196941 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 4723920, while the sum is 61.

The spelling of 511969196941 in words is "five hundred eleven billion, nine hundred sixty-nine million, one hundred ninety-six thousand, nine hundred forty-one".