Search a number
-
+
13102102010113 is a prime number
BaseRepresentation
bin1011111010101001001000…
…1000101101100100000001
31201101112211000110001022121
42332222102020231210001
53204131101103310423
643511004513004241
72521411205355304
oct276522210554401
951345730401277
1013102102010113
1141a1630017136
121577337553681
137406a4b0a90c
143342062d6b3b
1517ac381d445d
hexbea9222d901

13102102010113 has 2 divisors, whose sum is σ = 13102102010114. Its totient is φ = 13102102010112.

The previous prime is 13102102010111. The next prime is 13102102010159. The reversal of 13102102010113 is 31101020120131.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8866149401664 + 4235952608449 = 2977608^2 + 2058143^2 .

It is a cyclic number.

It is not a de Polignac number, because 13102102010113 - 21 = 13102102010111 is a prime.

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

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

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

Almost surely, 213102102010113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 13102102010113 its reverse (31101020120131), we get a palindrome (44203122130244).

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