Search a number
-
+
1326929 is a prime number
BaseRepresentation
bin101000011111101010001
32111102012112
411003331101
5314430204
644235105
714164412
oct5037521
92442175
101326929
11826a3a
1253ba95
13375c86
14267809
151b326e
hex143f51

1326929 has 2 divisors, whose sum is σ = 1326930. Its totient is φ = 1326928.

The previous prime is 1326917. The next prime is 1326943. The reversal of 1326929 is 9296231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1317904 + 9025 = 1148^2 + 95^2 .

It is a cyclic number.

It is not a de Polignac number, because 1326929 - 28 = 1326673 is a prime.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 1326895 and 1326904.

It is not a weakly prime, because it can be changed into another prime (1326989) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 663464 + 663465.

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

21326929 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5832, while the sum is 32.

The square root of 1326929 is about 1151.9240426348. The cubic root of 1326929 is about 109.8877367055.

It can be divided in two parts, 132 and 6929, that multiplied together give a triangular number (914628 = T1352).

The spelling of 1326929 in words is "one million, three hundred twenty-six thousand, nine hundred twenty-nine".