Search a number
-
+
325903213 is a prime number
BaseRepresentation
bin10011011011001…
…110001101101101
3211201020121011101
4103123032031231
51131412400323
652201123101
711035063066
oct2333161555
9751217141
10325903213
11157a669a9
1291189491
135269a14c
14313d756d
151d928dad
hex136ce36d

325903213 has 2 divisors, whose sum is σ = 325903214. Its totient is φ = 325903212.

The previous prime is 325903211. The next prime is 325903231. The reversal of 325903213 is 312309523.

Together with next prime (325903231) 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., 242674084 + 83229129 = 15578^2 + 9123^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 325903213 - 21 = 325903211 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2325903213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 325903213 is about 18052.7896182280. The cubic root of 325903213 is about 688.1707572877.

The spelling of 325903213 in words is "three hundred twenty-five million, nine hundred three thousand, two hundred thirteen".