Search a number
-
+
1863364151513 is a prime number
BaseRepresentation
bin11011000111011001001…
…010001000100011011001
320121010200001101120112002
4123013121022020203121
5221012132210322023
63544003452330345
7251423620645454
oct33073112104331
96533601346462
101863364151513
11659280538557
12261170a739b5
13106939956197
1466289d7a49b
153370c7d1b28
hex1b1d92888d9

1863364151513 has 2 divisors, whose sum is σ = 1863364151514. Its totient is φ = 1863364151512.

The previous prime is 1863364151489. The next prime is 1863364151543. The reversal of 1863364151513 is 3151514633681.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1563007541209 + 300356610304 = 1250203^2 + 548048^2 .

It is an emirp because it is prime and its reverse (3151514633681) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1863364151513 - 212 = 1863364147417 is a prime.

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

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

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

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

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

Almost surely, 21863364151513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 777600, while the sum is 47.

The spelling of 1863364151513 in words is "one trillion, eight hundred sixty-three billion, three hundred sixty-four million, one hundred fifty-one thousand, five hundred thirteen".