Search a number
-
+
140201111101 is a prime number
BaseRepresentation
bin1000001010010010100…
…0110010111000111101
3111101212212010101022111
42002210220302320331
54244112441023401
6144224004214021
713062212532022
oct2024450627075
9441785111274
10140201111101
1154505965967
122320909a311
13102b4447c4c
146b0021d549
1539a86e9e51
hex20a4a32e3d

140201111101 has 2 divisors, whose sum is σ = 140201111102. Its totient is φ = 140201111100.

The previous prime is 140201111069. The next prime is 140201111107. The reversal of 140201111101 is 101111102041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 115498702201 + 24702408900 = 339851^2 + 157170^2 .

It is a cyclic number.

It is not a de Polignac number, because 140201111101 - 25 = 140201111069 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2140201111101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 140201111101 its reverse (101111102041), we get a palindrome (241312213142).

The spelling of 140201111101 in words is "one hundred forty billion, two hundred one million, one hundred eleven thousand, one hundred one".