Search a number
-
+
5673431 is a prime number
BaseRepresentation
bin10101101001000111010111
3101200020111002
4111221013113
52423022211
6321333515
766136421
oct25510727
911606432
105673431
113225595
121a9729b
13123847a
14a79811
1577103b
hex5691d7

5673431 has 2 divisors, whose sum is σ = 5673432. Its totient is φ = 5673430.

The previous prime is 5673413. The next prime is 5673443. The reversal of 5673431 is 1343765.

Together with previous prime (5673413) 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 a de Polignac number, because none of the positive numbers 2k-5673431 is a prime.

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

It is a d-powerful number, because it can be written as 5 + 64 + 77 + 34 + 48 + 314 + 1 .

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

It is a congruent number.

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

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

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

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

Almost surely, 25673431 is an apocalyptic number.

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

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

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

The product of its digits is 7560, while the sum is 29.

The square root of 5673431 is about 2381.8965132852. The cubic root of 5673431 is about 178.3536188723.

It can be divided in two parts, 56734 and 31, that added together give a palindrome (56765).

The spelling of 5673431 in words is "five million, six hundred seventy-three thousand, four hundred thirty-one".