Search a number
-
+
434367431 is a prime number
BaseRepresentation
bin11001111000111…
…110101111000111
31010021100011002122
4121320332233013
51342144224211
6111034000155
713523030231
oct3170765707
91107304078
10434367431
11203209753
1210157605b
136bcb5464
144198d251
15282016db
hex19e3ebc7

434367431 has 2 divisors, whose sum is σ = 434367432. Its totient is φ = 434367430.

The previous prime is 434367413. The next prime is 434367433. The reversal of 434367431 is 134763434.

Together with previous prime (434367413) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 434367431 - 210 = 434366407 is a prime.

It is a super-2 number, since 2×4343674312 = 377350130227079522, which contains 22 as substring.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2434367431 is an apocalyptic number.

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

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

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

The product of its digits is 72576, while the sum is 35.

The square root of 434367431 is about 20841.4834164941. The cubic root of 434367431 is about 757.3310299269.

The spelling of 434367431 in words is "four hundred thirty-four million, three hundred sixty-seven thousand, four hundred thirty-one".