Search a number
-
+
56073131 is a prime number
BaseRepresentation
bin1101010111100…
…1101110101011
310220111210212122
43111321232223
5103323320011
65321501455
71250420342
oct325715653
9126453778
1056073131
1129719634
121694188b
13b80378a
147638b59
154dc93db
hex3579bab

56073131 has 2 divisors, whose sum is σ = 56073132. Its totient is φ = 56073130.

The previous prime is 56073119. The next prime is 56073133. The reversal of 56073131 is 13137065.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

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

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 56073131.

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

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

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

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

Almost surely, 256073131 is an apocalyptic number.

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

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

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

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

The square root of 56073131 is about 7488.1994498010. The cubic root of 56073131 is about 382.7527052662.

The spelling of 56073131 in words is "fifty-six million, seventy-three thousand, one hundred thirty-one".