Search a number
-
+
50890200062951 is a prime number
BaseRepresentation
bin10111001001000110011000…
…10011000001101111100111
320200012001111112121222000202
423210203030103001233213
523132241112204003301
6300122345110101115
713501460412205454
oct1344431423015747
9220161445558022
1050890200062951
111524045a25a157
12585aa4104a79b
132251c04a9b762
14c7d15526882b
155d3b86b4b66b
hex2e48cc4c1be7

50890200062951 has 2 divisors, whose sum is σ = 50890200062952. Its totient is φ = 50890200062950.

The previous prime is 50890200062899. The next prime is 50890200062963. The reversal of 50890200062951 is 15926000209805.

50890200062951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50890200062951 - 26 = 50890200062887 is a prime.

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

It is a congruent number.

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

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

Almost surely, 250890200062951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 388800, while the sum is 47.

The spelling of 50890200062951 in words is "fifty trillion, eight hundred ninety billion, two hundred million, sixty-two thousand, nine hundred fifty-one".