Search a number
-
+
2483662813 is a prime number
BaseRepresentation
bin1001010000001001…
…1010111111011101
320102002110010212121
42110002122333131
520041304202223
61050241302541
7115355533312
oct22402327735
96362403777
102483662813
111064a656a5
12593934a51
1330772c288
14197bdad09
15e80a015d
hex9409afdd

2483662813 has 2 divisors, whose sum is σ = 2483662814. Its totient is φ = 2483662812.

The previous prime is 2483662789. The next prime is 2483662837. The reversal of 2483662813 is 3182663842.

It is a balanced prime because it is at equal distance from previous prime (2483662789) and next prime (2483662837).

It can be written as a sum of positive squares in only one way, i.e., 2328834564 + 154828249 = 48258^2 + 12443^2 .

It is a cyclic number.

It is not a de Polignac number, because 2483662813 - 29 = 2483662301 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 2483662813.

It is a congruent number.

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

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

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

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

Almost surely, 22483662813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 331776, while the sum is 43.

The square root of 2483662813 is about 49836.3603506516. The cubic root of 2483662813 is about 1354.2459483748.

The spelling of 2483662813 in words is "two billion, four hundred eighty-three million, six hundred sixty-two thousand, eight hundred thirteen".