Search a number
-
+
329927901971 is a prime number
BaseRepresentation
bin1001100110100010011…
…11000100001100010011
31011112121020112222012212
410303101033010030103
520401143020330341
6411322231542335
732556630616013
oct4632117041423
91145536488185
10329927901971
11117a15776a88
1253b3822a9ab
132515c29c245
1411d7bb7dc43
1588aece55eb
hex4cd13c4313

329927901971 has 2 divisors, whose sum is σ = 329927901972. Its totient is φ = 329927901970.

The previous prime is 329927901917. The next prime is 329927902097. The reversal of 329927901971 is 179109729923.

Together with previous prime (329927901917) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

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

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2329927901971 is an apocalyptic number.

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

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

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

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

The spelling of 329927901971 in words is "three hundred twenty-nine billion, nine hundred twenty-seven million, nine hundred one thousand, nine hundred seventy-one".