Search a number
-
+
160122007469 is a prime number
BaseRepresentation
bin1001010100100000000…
…0111110111110101101
3120022022011210202210002
42111020000332332231
510110412213214334
6201320430154045
714365654415054
oct2251000767655
9508264722702
10160122007469
11619a8776186
1227048652925
131213a6174a8
147a6dbd339b
15427253cb7e
hex254803efad

160122007469 has 2 divisors, whose sum is σ = 160122007470. Its totient is φ = 160122007468.

The previous prime is 160122007439. The next prime is 160122007537. The reversal of 160122007469 is 964700221061.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 152822355625 + 7299651844 = 390925^2 + 85438^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 2160122007469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36288, while the sum is 38.

The spelling of 160122007469 in words is "one hundred sixty billion, one hundred twenty-two million, seven thousand, four hundred sixty-nine".