Search a number
-
+
201395564969 is a prime number
BaseRepresentation
bin1011101110010000011…
…1000111000110101001
3201020211121021201201212
42323210013013012221
511244424231034334
6232304141522505
720356525025354
oct2734407070651
9636747251655
10201395564969
1178458600885
1233046b73435
1315cb74a7071
149a6759b29b
15538ac3eece
hex2ee41c71a9

201395564969 has 2 divisors, whose sum is σ = 201395564970. Its totient is φ = 201395564968.

The previous prime is 201395564921. The next prime is 201395564977. The reversal of 201395564969 is 969465593102.

201395564969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 189116265625 + 12279299344 = 434875^2 + 110812^2 .

It is a cyclic number.

It is not a de Polignac number, because 201395564969 - 228 = 201127129513 is a prime.

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

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

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

Almost surely, 2201395564969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15746400, while the sum is 59.

The spelling of 201395564969 in words is "two hundred one billion, three hundred ninety-five million, five hundred sixty-four thousand, nine hundred sixty-nine".