Search a number
-
+
1329936077 is a prime number
BaseRepresentation
bin100111101000101…
…0011011011001101
310102200111202022202
41033101103123031
510210430423302
6335545051245
744646161441
oct11721233315
93380452282
101329936077
11622794728
12311486b25
131826b9b32
14c88b4821
157bb55202
hex4f4536cd

1329936077 has 2 divisors, whose sum is σ = 1329936078. Its totient is φ = 1329936076.

The previous prime is 1329936067. The next prime is 1329936109. The reversal of 1329936077 is 7706399231.

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., 1259611081 + 70324996 = 35491^2 + 8386^2 .

It is an emirp because it is prime and its reverse (7706399231) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1329936077 - 210 = 1329935053 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21329936077 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1329936077 is about 36468.2886491812. The cubic root of 1329936077 is about 1099.7068301363.

The spelling of 1329936077 in words is "one billion, three hundred twenty-nine million, nine hundred thirty-six thousand, seventy-seven".