Search a number
-
+
100021111000093 is a prime number
BaseRepresentation
bin10110101111011111111010…
…110010101000110000011101
3111010010220222012101110011001
4112233133322302220300131
5101102221213404000333
6552421021500430301
730032200241525413
oct2657377262506035
9433126865343131
10100021111000093
1129962795683a98
12b274917848391
1343a6c47a5338a
141a9b09489b2b3
15b86ba2d45b7d
hex5af7faca8c1d

100021111000093 has 2 divisors, whose sum is σ = 100021111000094. Its totient is φ = 100021111000092.

The previous prime is 100021111000073. The next prime is 100021111000201. The reversal of 100021111000093 is 390000111120001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 92597567754169 + 7423543245924 = 9622763^2 + 2724618^2 .

It is a cyclic number.

It is not a de Polignac number, because 100021111000093 - 237 = 99883672046621 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2100021111000093 is an apocalyptic number.

It is an amenable number.

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

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

100021111000093 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 54, while the sum is 19.

Adding to 100021111000093 its reverse (390000111120001), we get a palindrome (490021222120094).

The spelling of 100021111000093 in words is "one hundred trillion, twenty-one billion, one hundred eleven million, ninety-three", and thus it is an aban number.