Search a number
-
+
59051131 is a prime number
BaseRepresentation
bin1110000101000…
…0110001111011
311010010002220221
43201100301323
5110104114011
65505400511
71314632506
oct341206173
9133102827
1059051131
1130372a97
1217939137
13c3070c9
147bb213d
1552b6971
hex3850c7b

59051131 has 2 divisors, whose sum is σ = 59051132. Its totient is φ = 59051130.

The previous prime is 59051123. The next prime is 59051203. The reversal of 59051131 is 13115095.

59051131 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 59051131 - 23 = 59051123 is a prime.

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

It is equal to p3509206 and since 59051131 and 3509206 have the same sum of digits, it is a Honaker prime.

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

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

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

Almost surely, 259051131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 675, while the sum is 25.

The square root of 59051131 is about 7684.4733716762. The cubic root of 59051131 is about 389.4120683251.

The spelling of 59051131 in words is "fifty-nine million, fifty-one thousand, one hundred thirty-one".