Search a number
-
+
19635648651329 is a prime number
BaseRepresentation
bin1000111011011110001111…
…10111001110000001000001
32120112011001010010020221112
410131233013313032001001
510033202302023320304
6105432254212133105
74064425451452634
oct435570767160101
976464033106845
1019635648651329
116290482844057
12225162b007195
13ac583139a529
144bc5287b3c1b
15240b7ce4ab6e
hex11dbc7dce041

19635648651329 has 2 divisors, whose sum is σ = 19635648651330. Its totient is φ = 19635648651328.

The previous prime is 19635648651277. The next prime is 19635648651373. The reversal of 19635648651329 is 92315684653691.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15488120895025 + 4147527756304 = 3935495^2 + 2036548^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-19635648651329 is a prime.

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

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

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

Almost surely, 219635648651329 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 251942400, while the sum is 68.

The spelling of 19635648651329 in words is "nineteen trillion, six hundred thirty-five billion, six hundred forty-eight million, six hundred fifty-one thousand, three hundred twenty-nine".