Search a number
-
+
49038987017569 is a prime number
BaseRepresentation
bin10110010011001110001110…
…11001101011110101100001
320102122002012022200112111111
423021213013121223311201
522411423321134030234
6252144111041543321
713220643546021253
oct1311470731536541
9212562168615444
1049038987017569
111469735480057a
125600101644b41
1321494836a5603
14c176dd001cd3
155a093aed7664
hex2c99c766bd61

49038987017569 has 2 divisors, whose sum is σ = 49038987017570. Its totient is φ = 49038987017568.

The previous prime is 49038987017557. The next prime is 49038987017707. The reversal of 49038987017569 is 96571078983094.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 44741222676544 + 4297764341025 = 6688888^2 + 2073105^2 .

It is a cyclic number.

It is not a de Polignac number, because 49038987017569 - 237 = 48901548064097 is a prime.

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

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

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

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

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

Almost surely, 249038987017569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 823011840, while the sum is 76.

The spelling of 49038987017569 in words is "forty-nine trillion, thirty-eight billion, nine hundred eighty-seven million, seventeen thousand, five hundred sixty-nine".