Search a number
-
+
50060001060533 is a prime number
BaseRepresentation
bin10110110000111100000001…
…00101001010011010110101
320120020200121112201221200002
423120132000211022122311
523030140340232414113
6254245125204201045
713354500331133552
oct1330360045123265
9216220545657602
1050060001060533
1114a5036659aa22
125745b69099185
1321c183a461aa9
14c50cba295a29
155bc297521c58
hex2d878094a6b5

50060001060533 has 2 divisors, whose sum is σ = 50060001060534. Its totient is φ = 50060001060532.

The previous prime is 50060001060493. The next prime is 50060001060547. The reversal of 50060001060533 is 33506010006005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 32140078085284 + 17919922975249 = 5669222^2 + 4233193^2 .

It is a cyclic number.

It is not a de Polignac number, because 50060001060533 - 26 = 50060001060469 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 250060001060533 is an apocalyptic number.

It is an amenable number.

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

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

50060001060533 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.

Adding to 50060001060533 its reverse (33506010006005), we get a palindrome (83566011066538).

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