Search a number
-
+
201101301013423 is a prime number
BaseRepresentation
bin101101101110011010001011…
…100111000101101110101111
3222101001002121102210011012111
4231232122023213011232233
5202324320431024412143
61551412355020144451
760234042465423226
oct5556321347055657
9871032542704174
10201101301013423
11590936457a3a48
121a67a942998127
138829a04768485
1437934d7bd3cbd
15183b18dd8099d
hexb6e68b9c5baf

201101301013423 has 2 divisors, whose sum is σ = 201101301013424. Its totient is φ = 201101301013422.

The previous prime is 201101301013397. The next prime is 201101301013429. The reversal of 201101301013423 is 324310103101102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 201101301013423 - 25 = 201101301013391 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 201101301013394 and 201101301013403.

It is a congruent number.

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

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

Almost surely, 2201101301013423 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 22.

Adding to 201101301013423 its reverse (324310103101102), we get a palindrome (525411404114525).

The spelling of 201101301013423 in words is "two hundred one trillion, one hundred one billion, three hundred one million, thirteen thousand, four hundred twenty-three".