Search a number
-
+
4859694659 is a prime number
BaseRepresentation
bin1001000011010100…
…10000111001000011
3110112200101001211002
410201222100321003
534423040212114
62122120042215
7231266503001
oct44152207103
913480331732
104859694659
112074197586
12b3760336b
135c5a75591
143415bba71
151d698e7de
hex121a90e43

4859694659 has 2 divisors, whose sum is σ = 4859694660. Its totient is φ = 4859694658.

The previous prime is 4859694599. The next prime is 4859694661. The reversal of 4859694659 is 9564969584.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 4859694659 - 228 = 4591259203 is a prime.

It is a Sophie Germain prime.

Together with 4859694661, 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 = 4859694595 and 4859694604.

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

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

Almost surely, 24859694659 is an apocalyptic number.

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

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

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

The product of its digits is 83980800, while the sum is 65.

The square root of 4859694659 is about 69711.5102332463. The cubic root of 4859694659 is about 1693.8293775538.

The spelling of 4859694659 in words is "four billion, eight hundred fifty-nine million, six hundred ninety-four thousand, six hundred fifty-nine".