Search a number
-
+
4852837037 is a prime number
BaseRepresentation
bin1001000010100000…
…00110101010101101
3110112012110122221002
410201100012222231
534414311241122
62121313050045
7231154301636
oct44120065255
913465418832
104852837037
112070333324
12b35256925
135c4514109
1434071488d
151d6087992
hex121406aad

4852837037 has 2 divisors, whose sum is σ = 4852837038. Its totient is φ = 4852837036.

The previous prime is 4852837021. The next prime is 4852837081. The reversal of 4852837037 is 7307382584.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4443422281 + 409414756 = 66659^2 + 20234^2 .

It is a cyclic number.

It is not a de Polignac number, because 4852837037 - 24 = 4852837021 is a prime.

It is a super-3 number, since 3×48528370373 (a number of 30 digits) contains 333 as substring.

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

It is a congruent number.

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

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

Almost surely, 24852837037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1128960, while the sum is 47.

The square root of 4852837037 is about 69662.3071466916. The cubic root of 4852837037 is about 1693.0322692028.

The spelling of 4852837037 in words is "four billion, eight hundred fifty-two million, eight hundred thirty-seven thousand, thirty-seven".