Search a number
-
+
500061110011 is a prime number
BaseRepresentation
bin1110100011011011111…
…01101111111011111011
31202210202010012102102021
413101231331233323323
531143111121010021
61021420325015311
751061660205551
oct7215575577373
91683663172367
10500061110011
11183090507341
1280ab9554537
13382039c6048
141a2bb3adbd1
15d01b1a4c41
hex746df6fefb

500061110011 has 2 divisors, whose sum is σ = 500061110012. Its totient is φ = 500061110010.

The previous prime is 500061109969. The next prime is 500061110023. The reversal of 500061110011 is 110011160005.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 500061110011 - 27 = 500061109883 is a prime.

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

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

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

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

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

Almost surely, 2500061110011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 500061110011 its reverse (110011160005), we get a palindrome (610072270016).

The spelling of 500061110011 in words is "five hundred billion, sixty-one million, one hundred ten thousand, eleven".