Search a number
-
+
20114153121533 is a prime number
BaseRepresentation
bin1001001001011001100001…
…11100111010011011111101
32122012220010220200220201212
410210230300330322123331
510114022241144342113
6110440151523414205
74144125315366242
oct444546074723375
978186126626655
1020114153121533
116455401075899
12230a311224365
13b2b9ab054cb3
144d775cc535c9
1524d33689d0a8
hex124b30f3a6fd

20114153121533 has 2 divisors, whose sum is σ = 20114153121534. Its totient is φ = 20114153121532.

The previous prime is 20114153121509. The next prime is 20114153121539. The reversal of 20114153121533 is 33512135141102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19900003527364 + 214149594169 = 4460942^2 + 462763^2 .

It is a cyclic number.

It is not a de Polignac number, because 20114153121533 - 28 = 20114153121277 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 220114153121533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 32.

Adding to 20114153121533 its reverse (33512135141102), we get a palindrome (53626288262635).

The spelling of 20114153121533 in words is "twenty trillion, one hundred fourteen billion, one hundred fifty-three million, one hundred twenty-one thousand, five hundred thirty-three".