Search a number
-
+
1038739769 is a prime number
BaseRepresentation
bin111101111010011…
…110100100111001
32200101120110002022
4331322132210321
54111404133034
6251023444225
734512066554
oct7572364471
92611513068
101038739769
11493383621
1224ba56675
13137282222
149bd5369b
15612d4b2e
hex3de9e939

1038739769 has 2 divisors, whose sum is σ = 1038739770. Its totient is φ = 1038739768.

The previous prime is 1038739759. The next prime is 1038739783. The reversal of 1038739769 is 9679378301.

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., 988159225 + 50580544 = 31435^2 + 7112^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×10387397692 = 2157960615404346722, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1038739769.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21038739769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1714608, while the sum is 53.

The square root of 1038739769 is about 32229.4860182411. The cubic root of 1038739769 is about 1012.7500028691.

The spelling of 1038739769 in words is "one billion, thirty-eight million, seven hundred thirty-nine thousand, seven hundred sixty-nine".