Search a number
-
+
20126338769489 is a prime number
BaseRepresentation
bin1001001001110000001110…
…10001011110001001010001
32122021001121011010222012112
410210320013101132021101
510114222220211110424
6110445525024235105
74145036302603541
oct444700721361121
978231534128175
1020126338769489
11645a5945a7527
12231075216ba95
13b2cba07ba384
144d8197399321
1524d7eb59060e
hex124e0745e251

20126338769489 has 2 divisors, whose sum is σ = 20126338769490. Its totient is φ = 20126338769488.

The previous prime is 20126338769479. The next prime is 20126338769567. The reversal of 20126338769489 is 98496783362102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20086351968400 + 39986801089 = 4481780^2 + 199967^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 220126338769489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 188116992, while the sum is 68.

The spelling of 20126338769489 in words is "twenty trillion, one hundred twenty-six billion, three hundred thirty-eight million, seven hundred sixty-nine thousand, four hundred eighty-nine".