Search a number
-
+
91537013 is a prime number
BaseRepresentation
bin1010111010010…
…11111001110101
320101020120011202
411131023321311
5141413141023
613025542245
72161023521
oct535137165
9211216152
1091537013
1147741127
12267a4985
1315c6c719
14c22ad81
158082128
hex574be75

91537013 has 2 divisors, whose sum is σ = 91537014. Its totient is φ = 91537012.

The previous prime is 91536997. The next prime is 91537031. The reversal of 91537013 is 31073519.

Together with next prime (91537031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 70174129 + 21362884 = 8377^2 + 4622^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 91537013 - 24 = 91536997 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 291537013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2835, while the sum is 29.

The square root of 91537013 is about 9567.4977397437. The cubic root of 91537013 is about 450.6771911044.

The spelling of 91537013 in words is "ninety-one million, five hundred thirty-seven thousand, thirteen".