Search a number
-
+
32064211156013 is a prime number
BaseRepresentation
bin1110100101001100001111…
…11010100111110000101101
311012112022100000011022020122
413102212013322213300231
513200320001023443023
6152110032324054325
76516364020615611
oct722460772476055
9135468300138218
1032064211156013
11a2423a0315823
12371a3135343a5
1314b7846a1429a
147cbcb7acb341
153a90e508e2c8
hex1d2987ea7c2d

32064211156013 has 2 divisors, whose sum is σ = 32064211156014. Its totient is φ = 32064211156012.

The previous prime is 32064211155997. The next prime is 32064211156031. The reversal of 32064211156013 is 31065111246023.

Together with next prime (32064211156031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 26126031717769 + 5938179438244 = 5111363^2 + 2436838^2 .

It is a cyclic number.

It is not a de Polignac number, because 32064211156013 - 24 = 32064211155997 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 232064211156013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 32064211156013 in words is "thirty-two trillion, sixty-four billion, two hundred eleven million, one hundred fifty-six thousand, thirteen".