Search a number
-
+
161511115033 is a prime number
BaseRepresentation
bin1001011001101011010…
…0000000100100011001
3120102212222122202010101
42112122310000210121
510121233321140113
6202110331415401
714445252553252
oct2263264004431
9512788582111
10161511115033
11625508a5264
12273758b4561
13122cc351128
147b624abb29
1543044802dd
hex259ad00919

161511115033 has 2 divisors, whose sum is σ = 161511115034. Its totient is φ = 161511115032.

The previous prime is 161511115021. The next prime is 161511115043. The reversal of 161511115033 is 330511115161.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92724513049 + 68786601984 = 304507^2 + 262272^2 .

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

It is a cyclic number.

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

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

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

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

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

Almost surely, 2161511115033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 28.

The spelling of 161511115033 in words is "one hundred sixty-one billion, five hundred eleven million, one hundred fifteen thousand, thirty-three".