Search a number
-
+
90367313 is a prime number
BaseRepresentation
bin1010110001011…
…10010101010001
320022001010122112
411120232111101
5141113223223
612544515105
72145052361
oct530562521
9208033575
1090367313
1147012333
122631ba95
13159501aa
14c0049a1
157e00778
hex562e551

90367313 has 2 divisors, whose sum is σ = 90367314. Its totient is φ = 90367312.

The previous prime is 90367301. The next prime is 90367331. The reversal of 90367313 is 31376309.

Together with next prime (90367331) 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., 81504784 + 8862529 = 9028^2 + 2977^2 .

It is a cyclic number.

It is not a de Polignac number, because 90367313 - 220 = 89318737 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

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

Almost surely, 290367313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10206, while the sum is 32.

The square root of 90367313 is about 9506.1723632596. The cubic root of 90367313 is about 448.7493057409.

The spelling of 90367313 in words is "ninety million, three hundred sixty-seven thousand, three hundred thirteen".