Search a number
-
+
50093569 is a prime number
BaseRepresentation
bin1011111100010…
…1111000000001
310111021000110101
42333011320001
5100310443234
64545402401
71145534251
oct277057001
9114230411
1050093569
1126305049
1214939401
13a4bbb86
14691d961
1545e7814
hex2fc5e01

50093569 has 2 divisors, whose sum is σ = 50093570. Its totient is φ = 50093568.

The previous prime is 50093539. The next prime is 50093573. The reversal of 50093569 is 96539005.

50093569 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 can be written as a sum of positive squares in only one way, i.e., 26132544 + 23961025 = 5112^2 + 4895^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50093569 is a prime.

It is a super-2 number, since 2×500935692 = 5018731310315522, which contains 22 as substring.

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

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

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

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

Almost surely, 250093569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36450, while the sum is 37.

The square root of 50093569 is about 7077.6810467836. The cubic root of 50093569 is about 368.6328140894.

The spelling of 50093569 in words is "fifty million, ninety-three thousand, five hundred sixty-nine".