Search a number
-
+
132121202023313 is a prime number
BaseRepresentation
bin11110000010100111011101…
…010100000101101110010001
3122022210122220201211212020022
4132002213131110011232101
5114304133210204221223
61144555350422553225
736554304360335216
oct3602473524055621
9568718821755208
10132121202023313
1139109318171028
1212999b83298815
135894c8c055cc9
14248a9b388db0d
151041b97d16ac8
hex7829dd505b91

132121202023313 has 2 divisors, whose sum is σ = 132121202023314. Its totient is φ = 132121202023312.

The previous prime is 132121202023273. The next prime is 132121202023319. The reversal of 132121202023313 is 313320202121231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 124250102443009 + 7871099580304 = 11146753^2 + 2805548^2 .

It is a cyclic number.

It is not a de Polignac number, because 132121202023313 - 210 = 132121202022289 is a prime.

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

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

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

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

Almost surely, 2132121202023313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 26.

Adding to 132121202023313 its reverse (313320202121231), we get a palindrome (445441404144544).

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