Search a number
-
+
2309750830813 is a prime number
BaseRepresentation
bin100001100111000111111…
…000001011011011011101
322011210212111200101222011
4201213013320023123131
5300320332203041223
64525030200151221
7325605531060526
oct41470770133335
98153774611864
102309750830813
11810618146648
1231378aa68511
13139a6856bc4a
147db14a1384d
154013672b80d
hex219c7e0b6dd

2309750830813 has 2 divisors, whose sum is σ = 2309750830814. Its totient is φ = 2309750830812.

The previous prime is 2309750830811. The next prime is 2309750830931. The reversal of 2309750830813 is 3180380579032.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2270500485124 + 39250345689 = 1506818^2 + 198117^2 .

It is a cyclic number.

It is not a de Polignac number, because 2309750830813 - 21 = 2309750830811 is a prime.

It is a super-3 number, since 3×23097508308133 (a number of 38 digits) contains 333 as substring.

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

It is a congruent number.

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

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

Almost surely, 22309750830813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1088640, while the sum is 49.

The spelling of 2309750830813 in words is "two trillion, three hundred nine billion, seven hundred fifty million, eight hundred thirty thousand, eight hundred thirteen".