Search a number
-
+
20575156141 is a prime number
BaseRepresentation
bin10011001010010111…
…111111011110101101
31222002220210020011001
4103022113333132231
5314114214444031
613241353000301
71325604640651
oct231227773655
958086706131
1020575156141
1187a9159381
123ba26b3091
131c2b8b5407
14dd2842a61
158064cc861
hex4ca5ff7ad

20575156141 has 2 divisors, whose sum is σ = 20575156142. Its totient is φ = 20575156140.

The previous prime is 20575156139. The next prime is 20575156171. The reversal of 20575156141 is 14165157502.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20400123241 + 175032900 = 142829^2 + 13230^2 .

It is a cyclic number.

It is not a de Polignac number, because 20575156141 - 21 = 20575156139 is a prime.

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

Together with 20575156139, it forms a pair of twin primes.

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

It is a congruent number.

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

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

Almost surely, 220575156141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 42000, while the sum is 37.

The spelling of 20575156141 in words is "twenty billion, five hundred seventy-five million, one hundred fifty-six thousand, one hundred forty-one".