Search a number
-
+
10434313367 is a prime number
BaseRepresentation
bin10011011011110111…
…01111110010010111
3222221012000001001122
421231323233302113
5132332141011432
64443215314155
7516400125452
oct115573576227
928835001048
1010434313367
114474997085
12203251b95b
13ca398412a
1470dada499
1541109d612
hex26deefc97

10434313367 has 2 divisors, whose sum is σ = 10434313368. Its totient is φ = 10434313366.

The previous prime is 10434313321. The next prime is 10434313369. The reversal of 10434313367 is 76331343401.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10434313367 - 212 = 10434309271 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 210434313367 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54432, while the sum is 35.

Adding to 10434313367 its reverse (76331343401), we get a palindrome (86765656768).

The spelling of 10434313367 in words is "ten billion, four hundred thirty-four million, three hundred thirteen thousand, three hundred sixty-seven".