Search a number
-
+
5073376655551 is a prime number
BaseRepresentation
bin100100111010011110011…
…0100000011100010111111
3122222000021100020102220111
41021310330310003202333
51131110233410434201
614442402124530451
71032353001020461
oct111647464034277
918860240212814
105073376655551
11168667494a956
1269b3076b0a27
132aa556c4cc49
141377a4a10131
158be844c7b51
hex49d3cd038bf

5073376655551 has 2 divisors, whose sum is σ = 5073376655552. Its totient is φ = 5073376655550.

The previous prime is 5073376655507. The next prime is 5073376655609. The reversal of 5073376655551 is 1555566733705.

It is an a-pointer prime, because the next prime (5073376655609) can be obtained adding 5073376655551 to its sum of digits (58).

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5073376655551 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 25073376655551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 49612500, while the sum is 58.

The spelling of 5073376655551 in words is "five trillion, seventy-three billion, three hundred seventy-six million, six hundred fifty-five thousand, five hundred fifty-one".