Search a number
-
+
4657701341 is a prime number
BaseRepresentation
bin1000101011001111…
…01110000111011101
3110000121021202002002
410111213232013131
534014332420331
62050102412045
7223264544126
oct42547560735
913017252062
104657701341
111a80172a57
12a9ba31025
13592c70bc7
1432283b04d
151c3d8e9cb
hex1159ee1dd

4657701341 has 2 divisors, whose sum is σ = 4657701342. Its totient is φ = 4657701340.

The previous prime is 4657701277. The next prime is 4657701353. The reversal of 4657701341 is 1431077564.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4375293316 + 282408025 = 66146^2 + 16805^2 .

It is a cyclic number.

It is not a de Polignac number, because 4657701341 - 26 = 4657701277 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 24657701341 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70560, while the sum is 38.

The square root of 4657701341 is about 68247.3540952321. The cubic root of 4657701341 is about 1670.0284863727.

The spelling of 4657701341 in words is "four billion, six hundred fifty-seven million, seven hundred one thousand, three hundred forty-one".