Search a number
-
+
73156051 is a prime number
BaseRepresentation
bin1000101110001…
…00010111010011
312002122201020101
410113010113103
5122211443201
611131553231
71545546643
oct427042723
9162581211
1073156051
1138327251
12205bb817
1312205207
149a04523
156650d01
hex45c45d3

73156051 has 2 divisors, whose sum is σ = 73156052. Its totient is φ = 73156050.

The previous prime is 73156003. The next prime is 73156079. The reversal of 73156051 is 15065137.

It is an a-pointer prime, because the next prime (73156079) can be obtained adding 73156051 to its sum of digits (28).

It is a strong prime.

It is an emirp because it is prime and its reverse (15065137) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 73156051 - 221 = 71058899 is a prime.

It is a Chen prime.

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

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

Almost surely, 273156051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3150, while the sum is 28.

The square root of 73156051 is about 8553.1310641192. The cubic root of 73156051 is about 418.2315113671.

It can be divided in two parts, 7315 and 6051, that added together give a triangular number (13366 = T163).

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