Search a number
-
+
50601050005531 is a prime number
BaseRepresentation
bin10111000000101011110011…
…00111000110000000011011
320122011102011011210010102211
423200111321213012000123
523113021422300134111
6255341445040535551
713441543122236554
oct1340257147060033
9218142134703384
1050601050005531
111513986a61a353
1258129a53215b7
132230873a7841c
14c6d1650d532b
155cb3b1c8a521
hex2e05799c601b

50601050005531 has 2 divisors, whose sum is σ = 50601050005532. Its totient is φ = 50601050005530.

The previous prime is 50601050005501. The next prime is 50601050005567. The reversal of 50601050005531 is 13550005010605.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50601050005531 - 29 = 50601050005019 is a prime.

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

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

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

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

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

Almost surely, 250601050005531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 11250, while the sum is 31.

The spelling of 50601050005531 in words is "fifty trillion, six hundred one billion, fifty million, five thousand, five hundred thirty-one".