Search a number
-
+
32130121037057 is a prime number
BaseRepresentation
bin1110100111000111000000…
…11100110111010100000001
311012202121110101020011200222
413103203200130313110001
513202404441441141212
6152200212425352425
76524216231432321
oct723434034672401
9135677411204628
1032130121037057
11a26834277099a
12372b048638715
1314c0b1b9760b4
147d116b411281
153aaba1577c72
hex1d38e0737501

32130121037057 has 2 divisors, whose sum is σ = 32130121037058. Its totient is φ = 32130121037056.

The previous prime is 32130121037041. The next prime is 32130121037099. The reversal of 32130121037057 is 75073012103123.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 31483421998081 + 646699038976 = 5611009^2 + 804176^2 .

It is a cyclic number.

It is not a de Polignac number, because 32130121037057 - 24 = 32130121037041 is a prime.

It is a super-3 number, since 3×321301210370573 (a number of 41 digits) contains 333 as substring.

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

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

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

Almost surely, 232130121037057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26460, while the sum is 35.

The spelling of 32130121037057 in words is "thirty-two trillion, one hundred thirty billion, one hundred twenty-one million, thirty-seven thousand, fifty-seven".