Search a number
-
+
100032279368191 is a prime number
BaseRepresentation
bin10110101111101010010100…
…011110100101000111111111
3111010011222210112122022222221
4112233222110132211013333
5101102412102004240231
6552430110021350211
730033044064222352
oct2657522436450777
9433158715568887
10100032279368191
11299674a695a275
12b276b13b68367
1343a800780b301
141a9b833c78299
15b87108591d11
hex5afa947a51ff

100032279368191 has 2 divisors, whose sum is σ = 100032279368192. Its totient is φ = 100032279368190.

The previous prime is 100032279368107. The next prime is 100032279368213. The reversal of 100032279368191 is 191863972230001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 100032279368191 - 215 = 100032279335423 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2100032279368191 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 979776, while the sum is 52.

The spelling of 100032279368191 in words is "one hundred trillion, thirty-two billion, two hundred seventy-nine million, three hundred sixty-eight thousand, one hundred ninety-one".