Search a number
-
+
100111210111013 is a prime number
BaseRepresentation
bin10110110000110011110101…
…000111011110000000100101
3111010110112112100202111220012
4112300303311013132000211
5101110210224242023023
6552530242141220005
730041540053402163
oct2660636507360045
9433415470674805
10100111210111013
1129997a20239632
12b28a281861605
1343b25a626756a
141aa15a09d8233
15b891c7c4d978
hex5b0cf51de025

100111210111013 has 2 divisors, whose sum is σ = 100111210111014. Its totient is φ = 100111210111012.

The previous prime is 100111210110937. The next prime is 100111210111061. The reversal of 100111210111013 is 310111012111001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84780210818689 + 15330999292324 = 9207617^2 + 3915482^2 .

It is a cyclic number.

It is not a de Polignac number, because 100111210111013 - 28 = 100111210110757 is a prime.

It is a congruent number.

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

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

Almost surely, 2100111210111013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 14.

Adding to 100111210111013 its reverse (310111012111001), we get a palindrome (410222222222014).

The spelling of 100111210111013 in words is "one hundred trillion, one hundred eleven billion, two hundred ten million, one hundred eleven thousand, thirteen".