Search a number
-
+
100222102111751 is a prime number
BaseRepresentation
bin10110110010011011000110…
…110010111000011000000111
3111010212010202121121211020122
4112302123012302320120013
5101114014331120034001
6553053221553452155
730052544056013654
oct2662330662703007
9433763677554218
10100222102111751
1129a2aa55948034
12b2a786b27105b
1343bcb994b9b49
141aa6ac0454c2b
15b8c0182e2b1b
hex5b26c6cb8607

100222102111751 has 2 divisors, whose sum is σ = 100222102111752. Its totient is φ = 100222102111750.

The previous prime is 100222102111741. The next prime is 100222102111771. The reversal of 100222102111751 is 157111201222001.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 100222102111751 - 230 = 100221028369927 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2100222102111751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 560, while the sum is 26.

Adding to 100222102111751 its reverse (157111201222001), we get a palindrome (257333303333752).

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