Search a number
-
+
3113123210137 is a prime number
BaseRepresentation
bin101101010011010100100…
…110100110001110011001
3102000121111220112202200201
4231103110212212032121
5402001134020211022
610342052110302201
7440626044451333
oct55232446461631
912017456482621
103113123210137
11aa02a4990896
124234167b7961
131977490c0435
14aa966bd6453
1555ea5b1c127
hex2d4d49a6399

3113123210137 has 2 divisors, whose sum is σ = 3113123210138. Its totient is φ = 3113123210136.

The previous prime is 3113123210107. The next prime is 3113123210149. The reversal of 3113123210137 is 7310123213113.

3113123210137 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1560260802816 + 1552862407321 = 1249104^2 + 1246139^2 .

It is a cyclic number.

It is not a de Polignac number, because 3113123210137 - 27 = 3113123210009 is a prime.

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

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

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

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

Almost surely, 23113123210137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 28.

The spelling of 3113123210137 in words is "three trillion, one hundred thirteen billion, one hundred twenty-three million, two hundred ten thousand, one hundred thirty-seven".