Search a number
-
+
20031033227131 is a prime number
BaseRepresentation
bin1001000110111110101101…
…00111101011011101111011
32121220221121010221210012101
410203133112213223131323
510111142024001232011
6110334043555524231
74135123451060503
oct443372647533573
977827533853171
1020031033227131
116423128059993
1222b61945b9677
13b23bc274ab24
144d37159c2a03
1524b0be5562c1
hex1237d69eb77b

20031033227131 has 2 divisors, whose sum is σ = 20031033227132. Its totient is φ = 20031033227130.

The previous prime is 20031033227099. The next prime is 20031033227137. The reversal of 20031033227131 is 13172233013002.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20031033227131 - 25 = 20031033227099 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 20031033227131.

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

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

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

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

Almost surely, 220031033227131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4536, while the sum is 28.

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