Search a number
-
+
10324331029 is a prime number
BaseRepresentation
bin10011001110110000…
…01100101000010101
3222122112001100122201
421213120030220111
5132121012043104
64424250124501
7513563236315
oct114730145025
928575040581
1010324331029
1144188a7791
122001720731
13c86c56b1c
146dd26b445
154065c60a4
hex26760ca15

10324331029 has 2 divisors, whose sum is σ = 10324331030. Its totient is φ = 10324331028.

The previous prime is 10324331009. The next prime is 10324331051. The reversal of 10324331029 is 92013342301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7022104804 + 3302226225 = 83798^2 + 57465^2 .

It is a cyclic number.

It is not a de Polignac number, because 10324331029 - 213 = 10324322837 is a prime.

It is a super-2 number, since 2×103243310292 (a number of 21 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 210324331029 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10324331029 in words is "ten billion, three hundred twenty-four million, three hundred thirty-one thousand, twenty-nine".