Search a number
-
+
50170424674351 is a prime number
BaseRepresentation
bin10110110100001001101100…
…10101110100100000101111
320120122020122011020201221211
423122010312111310200233
523033443012204034401
6254411550325335251
713365456615305662
oct1332046625644057
9216566564221854
1050170424674351
1114a931808743a3
125763445867527
1321cc08764a557
14c563938296d9
155c00ab8e4951
hex2da13657482f

50170424674351 has 2 divisors, whose sum is σ = 50170424674352. Its totient is φ = 50170424674350.

The previous prime is 50170424674343. The next prime is 50170424674411. The reversal of 50170424674351 is 15347642407105.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50170424674351 - 23 = 50170424674343 is a prime.

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

It is a congruent number.

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

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

Almost surely, 250170424674351 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2822400, while the sum is 49.

The spelling of 50170424674351 in words is "fifty trillion, one hundred seventy billion, four hundred twenty-four million, six hundred seventy-four thousand, three hundred fifty-one".