Search a number
-
+
10325951 is a prime number
BaseRepresentation
bin100111011000…
…111110111111
3201102121112122
4213120332333
510120412301
61005153155
7153524546
oct47307677
921377478
1010325951
115913049
12355b7bb
1321a703c
14152b15d
15d8e81b
hex9d8fbf

10325951 has 2 divisors, whose sum is σ = 10325952. Its totient is φ = 10325950.

The previous prime is 10325933. The next prime is 10325957. The reversal of 10325951 is 15952301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10325951 - 214 = 10309567 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210325951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 26.

The square root of 10325951 is about 3213.4017800456. The cubic root of 10325951 is about 217.7592873742.

The spelling of 10325951 in words is "ten million, three hundred twenty-five thousand, nine hundred fifty-one".