Search a number
-
+
1039736729489 is a prime number
BaseRepresentation
bin11110010000101010010…
…00110110111110010001
310200101202001002102201212
433020111020312332101
5114013340100320424
62113352022305505
7135055434244223
oct17102510667621
93611661072655
101039736729489
11370a4a3069a7
12149611888295
137707b940323
1438475a82413
151c0a509710e
hexf215236f91

1039736729489 has 2 divisors, whose sum is σ = 1039736729490. Its totient is φ = 1039736729488.

The previous prime is 1039736729467. The next prime is 1039736729597. The reversal of 1039736729489 is 9849276379301.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 737566639489 + 302170090000 = 858817^2 + 549700^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 21039736729489 is an apocalyptic number.

It is an amenable number.

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

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

1039736729489 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 123451776, while the sum is 68.

The spelling of 1039736729489 in words is "one trillion, thirty-nine billion, seven hundred thirty-six million, seven hundred twenty-nine thousand, four hundred eighty-nine".