Search a number
-
+
20001010945453 is a prime number
BaseRepresentation
bin1001000110000110110010…
…01001110000110110101101
32121211002002211201212002221
410203003121021300312231
510110144032300223303
6110312200530115341
74133011460640466
oct443033111606655
977732084655087
1020001010945453
11641142128734a
1222b03b611bb51
13b21119883c05
144d20a8617d6d
1524a4139ca4bd
hex1230d9270dad

20001010945453 has 2 divisors, whose sum is σ = 20001010945454. Its totient is φ = 20001010945452.

The previous prime is 20001010945403. The next prime is 20001010945493. The reversal of 20001010945453 is 35454901010002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15904447089444 + 4096563856009 = 3988038^2 + 2023997^2 .

It is a cyclic number.

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

It is a super-3 number, since 3×200010109454533 (a number of 41 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 220001010945453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21600, while the sum is 34.

Adding to 20001010945453 its reverse (35454901010002), we get a palindrome (55455911955455).

The spelling of 20001010945453 in words is "twenty trillion, one billion, ten million, nine hundred forty-five thousand, four hundred fifty-three".