Search a number
-
+
129104596057 is a prime number
BaseRepresentation
bin111100000111100111…
…0111100110001011001
3110100020112002000022211
41320033032330301121
54103401234033212
6135150531315121
712220221650143
oct1701716746131
9410215060284
10129104596057
114a8311a6978
1221030a4baa1
13c23652a108
14636a5c7c93
1535594439a7
hex1e0f3bcc59

129104596057 has 2 divisors, whose sum is σ = 129104596058. Its totient is φ = 129104596056.

The previous prime is 129104596043. The next prime is 129104596097. The reversal of 129104596057 is 750695401921.

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., 126704673936 + 2399922121 = 355956^2 + 48989^2 .

It is a cyclic number.

It is not a de Polignac number, because 129104596057 - 27 = 129104595929 is a prime.

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

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

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

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

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

Almost surely, 2129104596057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 680400, while the sum is 49.

Adding to 129104596057 its reverse (750695401921), we get a palindrome (879799997978).

The spelling of 129104596057 in words is "one hundred twenty-nine billion, one hundred four million, five hundred ninety-six thousand, fifty-seven".