Search a number
-
+
50545452569 is a prime number
BaseRepresentation
bin101111000100101111…
…100110011000011001
311211110121012000212212
4233010233212120121
51312004113440234
635115324244505
73436364154323
oct570457463031
9154417160785
1050545452569
111a4886546a7
1299676a0735
1349c6a7a421
142636d58613
1514ac6da5ce
hexbc4be6619

50545452569 has 2 divisors, whose sum is σ = 50545452570. Its totient is φ = 50545452568.

The previous prime is 50545452493. The next prime is 50545452571. The reversal of 50545452569 is 96525454505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 46295977225 + 4249475344 = 215165^2 + 65188^2 .

It is a cyclic number.

It is not a de Polignac number, because 50545452569 - 220 = 50544403993 is a prime.

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

Together with 50545452571, it forms a pair of twin primes.

It is a Chen prime.

It is an alternating number because its digits alternate between odd and even.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 250545452569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400000, while the sum is 50.

The spelling of 50545452569 in words is "fifty billion, five hundred forty-five million, four hundred fifty-two thousand, five hundred sixty-nine".