Search a number
-
+
263104133462101 is a prime number
BaseRepresentation
bin111011110100101010110100…
…011010011111100001010101
31021111120111202102202211021101
4323310222310122133201111
5233441144231131241401
62331324211552550101
7106263434461452631
oct7364526432374125
91244514672684241
10263104133462101
1176918922257508
1225613415b52331
13b3a67c8629959
1448d8445249dc1
152063e2040a101
hexef4ab469f855

263104133462101 has 2 divisors, whose sum is σ = 263104133462102. Its totient is φ = 263104133462100.

The previous prime is 263104133462099. The next prime is 263104133462123. The reversal of 263104133462101 is 101264331401362.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 256916979676900 + 6187153785201 = 16028630^2 + 2487399^2 .

It is a cyclic number.

It is not a de Polignac number, because 263104133462101 - 21 = 263104133462099 is a prime.

Together with 263104133462099, it forms a pair of twin primes.

It is a congruent number.

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

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

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

Almost surely, 2263104133462101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 62208, while the sum is 37.

Adding to 263104133462101 its reverse (101264331401362), we get a palindrome (364368464863463).

The spelling of 263104133462101 in words is "two hundred sixty-three trillion, one hundred four billion, one hundred thirty-three million, four hundred sixty-two thousand, one hundred one".