Search a number
-
+
161051 = 115
BaseRepresentation
bin100111010100011011
322011220212
4213110123
520123201
63241335
71240352
oct472433
9264825
10161051
11100000
127924b
13583c7
1442999
1532abb
hex2751b

161051 has 6 divisors (see below), whose sum is σ = 177156. Its totient is φ = 146410.

The previous prime is 161047. The next prime is 161053. The reversal of 161051 is 150161.

It is a perfect power (a 5-th power), and thus also a powerful number.

It is not a de Polignac number, because 161051 - 22 = 161047 is a prime.

It is a Duffinian number.

It is a nialpdrome in base 11.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 161051.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14636 + ... + 14646.

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

161051 is a Friedman number, since it can be written as (6*(1+1+0)-1)^5, using all its digits and the basic arithmetic operations.

2161051 is an apocalyptic number.

161051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

161051 is an frugal number, since it uses more digits than its factorization.

161051 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 55 (or 11 counting only the distinct ones).

The product of its (nonzero) digits is 30, while the sum is 14.

The square root of 161051 is about 401.3115996330. The cubic root of 161051 is about 54.4069618757.

It can be divided in two parts, 1610 and 51, that added together give a palindrome (1661).

The spelling of 161051 in words is "one hundred sixty-one thousand, fifty-one".

Divisors: 1 11 121 1331 14641 161051