Search a number
-
+
4851555694481 is a prime number
BaseRepresentation
bin100011010011001011101…
…0000001111011110010001
3122011210201020222002011202
41012212113100033132101
51113441441224210411
614152435055520545
71010341033661246
oct106462720173621
918153636862152
104851555694481
111600595789731
12664320229155
13292665c073b2
1412ab608755cd
15863004dd83b
hex4699740f791

4851555694481 has 2 divisors, whose sum is σ = 4851555694482. Its totient is φ = 4851555694480.

The previous prime is 4851555694459. The next prime is 4851555694487. The reversal of 4851555694481 is 1844965551584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4186050528256 + 665505166225 = 2045984^2 + 815785^2 .

It is a cyclic number.

It is not a de Polignac number, because 4851555694481 - 26 = 4851555694417 is a prime.

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

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

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

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

Almost surely, 24851555694481 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 4851555694481 in words is "four trillion, eight hundred fifty-one billion, five hundred fifty-five million, six hundred ninety-four thousand, four hundred eighty-one".