Search a number
-
+
10032201132313 is a prime number
BaseRepresentation
bin1001000111111100110111…
…0010001110100100011001
31022112001212100100021002111
42101333031302032210121
52303331421442213223
633200421331032321
72053542203426443
oct221771562164431
938461770307074
1010032201132313
1132186a6000368
121160383a3b6a1
1357a05655a479
142697bda2b493
15125e61e0e30d
hex91fcdc8e919

10032201132313 has 2 divisors, whose sum is σ = 10032201132314. Its totient is φ = 10032201132312.

The previous prime is 10032201132257. The next prime is 10032201132337. The reversal of 10032201132313 is 31323110223001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10027684889104 + 4516243209 = 3166652^2 + 67203^2 .

It is a cyclic number.

It is not a de Polignac number, because 10032201132313 - 29 = 10032201131801 is a prime.

It is not a weakly prime, because it can be changed into another prime (10032201132113) 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, 5016100566156 + 5016100566157.

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

Almost surely, 210032201132313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 22.

Adding to 10032201132313 its reverse (31323110223001), we get a palindrome (41355311355314).

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