Search a number
-
+
10111010010113 is a prime number
BaseRepresentation
bin1001001100100010011100…
…1010001111010000000001
31022210121021200011001121102
42103020213022033100001
52311124322030310423
633300533414504145
72062332153016535
oct223104712172001
938717250131542
1010111010010113
113249067614731
1211736b8965055
1358460598893c
1426d538507bc5
15128025a47c28
hex9322728f401

10111010010113 has 2 divisors, whose sum is σ = 10111010010114. Its totient is φ = 10111010010112.

The previous prime is 10111010010097. The next prime is 10111010010137. The reversal of 10111010010113 is 31101001011101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10065244820929 + 45765189184 = 3172577^2 + 213928^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111010010113 - 24 = 10111010010097 is a prime.

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

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

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

Almost surely, 210111010010113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 10111010010113 its reverse (31101001011101), we get a palindrome (41212011021214).

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