Search a number
-
+
162150500531 is a prime number
BaseRepresentation
bin1001011100000011101…
…1000100100010110011
3120111112112202220010202
42113000323010202303
510124041012004111
6202254011545415
714500145341025
oct2270073044263
9514475686122
10162150500531
1162849804028
1227513a5b26b
13123a1959946
147bc3388015
15434067cb3b
hex25c0ec48b3

162150500531 has 2 divisors, whose sum is σ = 162150500532. Its totient is φ = 162150500530.

The previous prime is 162150500513. The next prime is 162150500599. The reversal of 162150500531 is 135005051261.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 162150500531 - 222 = 162146306227 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 162150500494 and 162150500503.

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

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

Almost surely, 2162150500531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 29.

Adding to 162150500531 its reverse (135005051261), we get a palindrome (297155551792).

The spelling of 162150500531 in words is "one hundred sixty-two billion, one hundred fifty million, five hundred thousand, five hundred thirty-one".