Search a number
-
+
44852537 is a prime number
BaseRepresentation
bin1010101100011…
…0010100111001
310010101202010002
42223012110321
542440240122
64241202345
71053145262
oct253062471
9103352102
1044852537
1123355414
12130303b5
1393a5482
145d57969
153e0e992
hex2ac6539

44852537 has 2 divisors, whose sum is σ = 44852538. Its totient is φ = 44852536.

The previous prime is 44852513. The next prime is 44852539. The reversal of 44852537 is 73525844.

It is a happy number.

44852537 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 39740416 + 5112121 = 6304^2 + 2261^2 .

It is a cyclic number.

It is not a de Polignac number, because 44852537 - 28 = 44852281 is a prime.

Together with 44852539, 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 44852537.

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

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

Almost surely, 244852537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 134400, while the sum is 38.

The square root of 44852537 is about 6697.2036701895. The cubic root of 44852537 is about 355.3003792380.

The spelling of 44852537 in words is "forty-four million, eight hundred fifty-two thousand, five hundred thirty-seven".