Search a number
-
+
506203325524051 is a prime number
BaseRepresentation
bin111001100011000111010010…
…1011001101110100001010011
32110101022120021002222000012121
41303012032211121232201103
51012322113402313232201
64552334333012235111
7211423661205052351
oct16306164531564123
92411276232860177
10506203325524051
11137323696623901
124893571960ba97
131895b9cbcc085c
148d0052bc6c7d1
153d7c79bc509a1
hex1cc63a566e853

506203325524051 has 2 divisors, whose sum is σ = 506203325524052. Its totient is φ = 506203325524050.

The previous prime is 506203325524009. The next prime is 506203325524109. The reversal of 506203325524051 is 150425523302605.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 506203325524051 - 27 = 506203325523923 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 506203325523989 and 506203325524007.

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

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

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

Almost surely, 2506203325524051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1080000, while the sum is 43.

Adding to 506203325524051 its reverse (150425523302605), we get a palindrome (656628848826656).

The spelling of 506203325524051 in words is "five hundred six trillion, two hundred three billion, three hundred twenty-five million, five hundred twenty-four thousand, fifty-one".