Search a number
-
+
16976549201 is a prime number
BaseRepresentation
bin11111100111110000…
…11001010101010001
31121211010101001110112
433303320121111101
5234231444033301
611444322211105
71140460200353
oct176370312521
947733331415
1016976549201
117221901757
1233594b3a95
1317a71a23b1
14b709370d3
156955e39bb
hex3f3e19551

16976549201 has 2 divisors, whose sum is σ = 16976549202. Its totient is φ = 16976549200.

The previous prime is 16976549141. The next prime is 16976549209. The reversal of 16976549201 is 10294567961.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15441790225 + 1534758976 = 124265^2 + 39176^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-16976549201 is a prime.

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

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

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

Almost surely, 216976549201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 816480, while the sum is 50.

The spelling of 16976549201 in words is "sixteen billion, nine hundred seventy-six million, five hundred forty-nine thousand, two hundred one".