Search a number
-
+
4858793164769 is a prime number
BaseRepresentation
bin100011010110100011010…
…1000111111111111100001
3122012111101122112122221212
41012231012220333333201
51114101302022233034
614200033155555505
71011015265315565
oct106550650777741
918174348478855
104858793164769
11160366a089235
126657bbbbbb95
1329324a4868ab
1412b249b696a5
15865c5ab42ce
hex46b46a3ffe1

4858793164769 has 2 divisors, whose sum is σ = 4858793164770. Its totient is φ = 4858793164768.

The previous prime is 4858793164681. The next prime is 4858793164867. The reversal of 4858793164769 is 9674613978584.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4698216646369 + 160576518400 = 2167537^2 + 400720^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×48587931647692 (a number of 26 digits) contains 22 as substring.

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

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

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

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

Almost surely, 24858793164769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2194698240, while the sum is 77.

The spelling of 4858793164769 in words is "four trillion, eight hundred fifty-eight billion, seven hundred ninety-three million, one hundred sixty-four thousand, seven hundred sixty-nine".