Search a number
-
+
465091213 is a prime number
BaseRepresentation
bin11011101110001…
…011101010001101
31012102011002012111
4123232023222031
51423030404323
6114052304021
714345132026
oct3356135215
91172132174
10465091213
11219593a04
1210b912011
1375481a02
1445aa9c4d
152ac6ec0d
hex1bb8ba8d

465091213 has 2 divisors, whose sum is σ = 465091214. Its totient is φ = 465091212.

The previous prime is 465091189. The next prime is 465091217. The reversal of 465091213 is 312190564.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 318729609 + 146361604 = 17853^2 + 12098^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 2465091213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6480, while the sum is 31.

The square root of 465091213 is about 21565.9734999373. The cubic root of 465091213 is about 774.7817424937.

The spelling of 465091213 in words is "four hundred sixty-five million, ninety-one thousand, two hundred thirteen".