Search a number
-
+
103020113081 is a prime number
BaseRepresentation
bin101111111110001111…
…0100010110010111001
3100211220122111222112202
41133330132202302321
53141441122104311
6115154330315545
710304635340624
oct1377436426271
9324818458482
10103020113081
113a766193826
1217b71288bb5
13993a4169c2
144db41c0dbb
152a2e452e3b
hex17fc7a2cb9

103020113081 has 2 divisors, whose sum is σ = 103020113082. Its totient is φ = 103020113080.

The previous prime is 103020113071. The next prime is 103020113159. The reversal of 103020113081 is 180311020301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 75836347456 + 27183765625 = 275384^2 + 164875^2 .

It is an emirp because it is prime and its reverse (180311020301) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-103020113081 is a prime.

It is a super-2 number, since 2×1030201130812 (a number of 23 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2103020113081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 20.

Adding to 103020113081 its reverse (180311020301), we get a palindrome (283331133382).

The spelling of 103020113081 in words is "one hundred three billion, twenty million, one hundred thirteen thousand, eighty-one".