Search a number
-
+
5061000060533 is a prime number
BaseRepresentation
bin100100110100101101100…
…0111000101111001110101
3122220211022210111021022102
41021221123013011321311
51130404412003414113
614432554043311445
71031434204502204
oct111513307057165
918824283437272
105061000060533
1116813a365992a
12698a3281b585
132a9333a80041
14136d4cda123b
158b9acb68758
hex49a5b1c5e75

5061000060533 has 2 divisors, whose sum is σ = 5061000060534. Its totient is φ = 5061000060532.

The previous prime is 5061000060463. The next prime is 5061000060551. The reversal of 5061000060533 is 3350600001605.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5036245128964 + 24754931569 = 2244158^2 + 157337^2 .

It is a cyclic number.

It is not a de Polignac number, because 5061000060533 - 218 = 5060999798389 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 25061000060533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 29.

The spelling of 5061000060533 in words is "five trillion, sixty-one billion, sixty thousand, five hundred thirty-three".