Search a number
-
+
4856658047 is a prime number
BaseRepresentation
bin1001000010111101…
…01011100001111111
3110112110122210100222
410201132223201333
534421301024142
62121531011555
7231231624623
oct44136534177
913473583328
104856658047
11207250308a
12b36599bbb
135c5251377
1434102b183
151d658ebd2
hex1217ab87f

4856658047 has 2 divisors, whose sum is σ = 4856658048. Its totient is φ = 4856658046.

The previous prime is 4856658017. The next prime is 4856658049. The reversal of 4856658047 is 7408566584.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 4856658047 - 218 = 4856395903 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

Almost surely, 24856658047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6451200, while the sum is 53.

The square root of 4856658047 is about 69689.7269832506. The cubic root of 4856658047 is about 1693.4765039225.

The spelling of 4856658047 in words is "four billion, eight hundred fifty-six million, six hundred fifty-eight thousand, forty-seven".