Search a number
-
+
132301322120041 is a prime number
BaseRepresentation
bin11110000101001111001101…
…010011101110101101101001
3122100102212211121120211012221
4132011033031103232231221
5114320111101430320131
61145214215513434041
736603312045031444
oct3605171523565551
9570385747524187
10132301322120041
11391787482806a8
1212a08a7110b921
1358a8c658294b9
1424955bd5cc65b
1510466dad44411
hex7853cd4eeb69

132301322120041 has 2 divisors, whose sum is σ = 132301322120042. Its totient is φ = 132301322120040.

The previous prime is 132301322120021. The next prime is 132301322120053. The reversal of 132301322120041 is 140021223103231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104935868680041 + 27365453440000 = 10243821^2 + 5231200^2 .

It is a cyclic number.

It is not a de Polignac number, because 132301322120041 - 29 = 132301322119529 is a prime.

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

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

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

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

Almost surely, 2132301322120041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728, while the sum is 25.

Adding to 132301322120041 its reverse (140021223103231), we get a palindrome (272322545223272).

The spelling of 132301322120041 in words is "one hundred thirty-two trillion, three hundred one billion, three hundred twenty-two million, one hundred twenty thousand, forty-one".