Search a number
-
+
20152569061 is a prime number
BaseRepresentation
bin10010110001001011…
…111100110011100101
31221000110121120122201
4102301023330303211
5312233024202221
613131415254501
71312254003442
oct226113746345
957013546581
1020152569061
118601666459
123aa507a431
131b92195ca1
14d9267c9c9
157ce356891
hex4b12fcce5

20152569061 has 2 divisors, whose sum is σ = 20152569062. Its totient is φ = 20152569060.

The previous prime is 20152569023. The next prime is 20152569079. The reversal of 20152569061 is 16096525102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11469124836 + 8683444225 = 107094^2 + 93185^2 .

It is a cyclic number.

It is not a de Polignac number, because 20152569061 - 223 = 20144180453 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 220152569061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 20152569061 in words is "twenty billion, one hundred fifty-two million, five hundred sixty-nine thousand, sixty-one".