Search a number
-
+
10051161 = 3233137127
BaseRepresentation
bin100110010101…
…111001011001
3200220122121020
4212111321121
510033114121
6555233053
7151301451
oct46257131
920818536
1010051161
11574564a
123448789
13210bc43
141498d61
15d381c6
hex995e59

10051161 has 32 divisors (see below), whose sum is σ = 14942208. Its totient is φ = 5987520.

The previous prime is 10051157. The next prime is 10051163. The reversal of 10051161 is 16115001.

It is not a de Polignac number, because 10051161 - 22 = 10051157 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10051161.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79080 + ... + 79206.

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

Almost surely, 210051161 is an apocalyptic number.

It is an amenable number.

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

10051161 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 221.

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

The square root of 10051161 is about 3170.3566045478. The cubic root of 10051161 is about 215.8102543197.

Adding to 10051161 its reverse (16115001), we get a palindrome (26166162).

The spelling of 10051161 in words is "ten million, fifty-one thousand, one hundred sixty-one".

Divisors: 1 3 23 31 37 69 93 111 127 381 713 851 1147 2139 2553 2921 3441 3937 4699 8763 11811 14097 26381 79143 90551 108077 145669 271653 324231 437007 3350387 10051161