Search a number
-
+
3102130143113 is a prime number
BaseRepresentation
bin101101001001000101010…
…111010111111110001001
3101222120010210011002201012
4231021011113113332021
5401311130304034423
610333033210533305
7440056451102261
oct55110527277611
911876123132635
103102130143113
11a96673658931
12421269137235
131966b6752651
14aa202c0c7a1
1555a6099c078
hex2d2455d7f89

3102130143113 has 2 divisors, whose sum is σ = 3102130143114. Its totient is φ = 3102130143112.

The previous prime is 3102130143109. The next prime is 3102130143149. The reversal of 3102130143113 is 3113410312013.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2658376985209 + 443753157904 = 1630453^2 + 666148^2 .

It is a cyclic number.

It is not a de Polignac number, because 3102130143113 - 22 = 3102130143109 is a prime.

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

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

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

Almost surely, 23102130143113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 23.

Adding to 3102130143113 its reverse (3113410312013), we get a palindrome (6215540455126).

The spelling of 3102130143113 in words is "three trillion, one hundred two billion, one hundred thirty million, one hundred forty-three thousand, one hundred thirteen".