Search a number
-
+
6414859931 is a prime number
BaseRepresentation
bin1011111100101101…
…01111111010011011
3121120001200122111212
411332112233322123
5101114201004211
62540312413335
7314652260354
oct57626577233
917501618455
106414859931
1127a2026237
1212b03a724b
137b301100c
1444bd60d2b
1527828438b
hex17e5afe9b

6414859931 has 2 divisors, whose sum is σ = 6414859932. Its totient is φ = 6414859930.

The previous prime is 6414859909. The next prime is 6414859949. The reversal of 6414859931 is 1399584146.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-6414859931 is a prime.

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

It is a Sophie Germain prime.

It is a self number, because there is not a number n which added to its sum of digits gives 6414859931.

It is not a weakly prime, because it can be changed into another prime (6414853931) 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, 3207429965 + 3207429966.

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

Almost surely, 26414859931 is an apocalyptic number.

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

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

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

The product of its digits is 933120, while the sum is 50.

The square root of 6414859931 is about 80092.8207207113. The cubic root of 6414859931 is about 1858.0713746125.

The spelling of 6414859931 in words is "six billion, four hundred fourteen million, eight hundred fifty-nine thousand, nine hundred thirty-one".