Search a number
-
+
179901110099489 is a prime number
BaseRepresentation
bin101000111001111001111101…
…110000110001111000100001
3212120222101012200101002212212
4220321321331300301320201
5142034444433141140424
61434341232401331505
752615266134063012
oct5071717560617041
9776871180332785
10179901110099489
115235a6a5703409
1218216059936b95
13794c7a947431c
14325d38dd53009
1515be99269c10e
hexa39e7dc31e21

179901110099489 has 2 divisors, whose sum is σ = 179901110099490. Its totient is φ = 179901110099488.

The previous prime is 179901110099419. The next prime is 179901110099497. The reversal of 179901110099489 is 984990011109971.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 155793334158400 + 24107775941089 = 12481720^2 + 4909967^2 .

It is a cyclic number.

It is not a de Polignac number, because 179901110099489 - 224 = 179901093322273 is a prime.

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

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

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

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

Almost surely, 2179901110099489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13226976, while the sum is 68.

The spelling of 179901110099489 in words is "one hundred seventy-nine trillion, nine hundred one billion, one hundred ten million, ninety-nine thousand, four hundred eighty-nine".