Search a number
-
+
2351320117 is a prime number
BaseRepresentation
bin1000110000100110…
…0100110000110101
320001212102102211021
42030021210300311
514303414220432
61025152541141
7112160614456
oct21411446065
96055372737
102351320117
11aa7293673
125575517b1
132b61a33a3
141843cb12d
15db65c697
hex8c264c35

2351320117 has 2 divisors, whose sum is σ = 2351320118. Its totient is φ = 2351320116.

The previous prime is 2351320093. The next prime is 2351320157. The reversal of 2351320117 is 7110231532.

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., 1498154436 + 853165681 = 38706^2 + 29209^2 .

It is a cyclic number.

It is not a de Polignac number, because 2351320117 - 219 = 2350795829 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 2351320091 and 2351320100.

It is a congruent number.

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

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

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

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

Almost surely, 22351320117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1260, while the sum is 25.

The square root of 2351320117 is about 48490.4126297148. The cubic root of 2351320117 is about 1329.7517988988.

Adding to 2351320117 its reverse (7110231532), we get a palindrome (9461551649).

The spelling of 2351320117 in words is "two billion, three hundred fifty-one million, three hundred twenty thousand, one hundred seventeen".