Search a number
-
+
161520111071051 = 169995067752249
BaseRepresentation
bin100100101110011011010100…
…110110000010111101001011
3210011220011122020212110001212
4210232123110312002331023
5132132321141413233201
61331305151545003335
746010304632165525
oct4456332466027513
9704804566773055
10161520111071051
1147513326973a47
121614781a48354b
136c18386804375
142bc5887b30a15
1513a17970c7abb
hex92e6d4d82f4b

161520111071051 has 4 divisors (see below), whose sum is σ = 161615178825000. Its totient is φ = 161425043317104.

The previous prime is 161520111071041. The next prime is 161520111071087. The reversal of 161520111071051 is 150170111025161.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (161520111071041) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47533874426 + ... + 47533877823.

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

Almost surely, 2161520111071051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 95067753948.

The product of its (nonzero) digits is 2100, while the sum is 32.

The spelling of 161520111071051 in words is "one hundred sixty-one trillion, five hundred twenty billion, one hundred eleven million, seventy-one thousand, fifty-one".

Divisors: 1 1699 95067752249 161520111071051