Search a number
-
+
50433974951561 is a prime number
BaseRepresentation
bin10110111011110100100110…
…01010010101111010001001
320121120102220102120222221222
423131322103022111322021
523102302240041422221
6255133014230411425
713423506625561055
oct1335722312257211
9217512812528858
1050433974951561
1115084a2405a453
1257a6538200b75
13221ab98ab7846
14c65035ac8c65
155c6d8410a9ab
hex2dde93295e89

50433974951561 has 2 divisors, whose sum is σ = 50433974951562. Its totient is φ = 50433974951560.

The previous prime is 50433974951551. The next prime is 50433974951579. The reversal of 50433974951561 is 16515947933405.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 37716056995600 + 12717917955961 = 6141340^2 + 3566219^2 .

It is a cyclic number.

It is not a de Polignac number, because 50433974951561 - 214 = 50433974935177 is a prime.

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

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

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

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

Almost surely, 250433974951561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 61236000, while the sum is 62.

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