Search a number
-
+
50565041 is a prime number
BaseRepresentation
bin1100000011100…
…0111110110001
310112010222012022
43000320332301
5100421040131
65003441225
71152536642
oct300707661
9115128168
1050565041
11265a729a
1214b26215
13a625657
146a036c9
15468c37b
hex3038fb1

50565041 has 2 divisors, whose sum is σ = 50565042. Its totient is φ = 50565040.

The previous prime is 50565037. The next prime is 50565059. The reversal of 50565041 is 14056505.

50565041 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 can be written as a sum of positive squares in only one way, i.e., 47554816 + 3010225 = 6896^2 + 1735^2 .

It is a cyclic number.

It is not a de Polignac number, because 50565041 - 22 = 50565037 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 50565041.

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

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

Almost surely, 250565041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3000, while the sum is 26.

The square root of 50565041 is about 7110.9099980242. The cubic root of 50565041 is about 369.7857074195.

It can be divided in two parts, 5056504 and 1, that added together give a palindrome (5056505).

The spelling of 50565041 in words is "fifty million, five hundred sixty-five thousand, forty-one".