Search a number
-
+
10102011011293 is a prime number
BaseRepresentation
bin1001001100000000111011…
…0001110010000011011101
31022202202001111221112221211
42103000032301302003131
52311002404304330133
633252444431024421
72061563151545425
oct223001661620335
938682044845854
1010102011011293
113245269947723
121171a0706b111
13583800499276
1426cd232b3485
15127b9a9b7bcd
hex9300ec720dd

10102011011293 has 2 divisors, whose sum is σ = 10102011011294. Its totient is φ = 10102011011292.

The previous prime is 10102011011291. The next prime is 10102011011369. The reversal of 10102011011293 is 39211011020101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10099448829369 + 2562181924 = 3177963^2 + 50618^2 .

It is a cyclic number.

It is not a de Polignac number, because 10102011011293 - 21 = 10102011011291 is a prime.

Together with 10102011011291, 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 (10102011011291) by changing a digit.

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

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

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

Almost surely, 210102011011293 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10102011011293 its reverse (39211011020101), we get a palindrome (49313022031394).

The spelling of 10102011011293 in words is "ten trillion, one hundred two billion, eleven million, eleven thousand, two hundred ninety-three".