Search a number
-
+
165030013923487 is a prime number
BaseRepresentation
bin100101100001100000001011…
…010110110111000010011111
3210122022201022102022110110221
4211201200023112313002133
5133112322432031022422
61342553424120142211
746522011406162216
oct4541401326670237
9718281272273427
10165030013923487
1148646921599789
1216613b09907967
137111356cb711b
142ca76d112207d
151412c21a1d3c7
hex96180b5b709f

165030013923487 has 2 divisors, whose sum is σ = 165030013923488. Its totient is φ = 165030013923486.

The previous prime is 165030013923473. The next prime is 165030013923499. The reversal of 165030013923487 is 784329310030561.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 165030013923487 - 211 = 165030013921439 is a prime.

It is a congruent number.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅165030013923487 = 330060027846974 is not.

Almost surely, 2165030013923487 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 52.

The spelling of 165030013923487 in words is "one hundred sixty-five trillion, thirty billion, thirteen million, nine hundred twenty-three thousand, four hundred eighty-seven".