Search a number
-
+
2020001820181 is a prime number
BaseRepresentation
bin11101011001010001011…
…111011010111000010101
321011002222101210121000221
4131121101133122320111
5231043430431221211
64143550453234341
7265640346112432
oct35312137327025
97132871717027
102020001820181
11709750403394
122875a66329b1
13118640428627
146daa90cab89
1537828ea7c71
hex1d6517dae15

2020001820181 has 2 divisors, whose sum is σ = 2020001820182. Its totient is φ = 2020001820180.

The previous prime is 2020001820169. The next prime is 2020001820227. The reversal of 2020001820181 is 1810281000202.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1220781912100 + 799219908081 = 1104890^2 + 893991^2 .

It is a cyclic number.

It is not a de Polignac number, because 2020001820181 - 215 = 2020001787413 is a prime.

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

It is a congruent number.

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

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

Almost surely, 22020001820181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 512, while the sum is 25.

Adding to 2020001820181 its reverse (1810281000202), we get a palindrome (3830282820383).

The spelling of 2020001820181 in words is "two trillion, twenty billion, one million, eight hundred twenty thousand, one hundred eighty-one".