Search a number
-
+
160036901 is a prime number
BaseRepresentation
bin10011000100111…
…11100000100101
3102011010201100122
421202133200211
5311432140101
623514051325
73652201613
oct1142374045
9364121318
10160036901
1182378102
1245719b45
13272044bb
141737c6b3
15e0b351b
hex989f825

160036901 has 2 divisors, whose sum is σ = 160036902. Its totient is φ = 160036900.

The previous prime is 160036883. The next prime is 160036907. The reversal of 160036901 is 109630061.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87871876 + 72165025 = 9374^2 + 8495^2 .

It is an emirp because it is prime and its reverse (109630061) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 160036901 - 210 = 160035877 is a prime.

It is a super-2 number, since 2×1600369012 = 51223619363367602, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2160036901 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 26.

The square root of 160036901 is about 12650.5691966804. The cubic root of 160036901 is about 542.9252554128.

Adding to 160036901 its reverse (109630061), we get a palindrome (269666962).

The spelling of 160036901 in words is "one hundred sixty million, thirty-six thousand, nine hundred one".