[go: up one dir, main page]

Search a number
-
+
10111161 = 33370387
BaseRepresentation
bin100110100100…
…100010111001
3201000200220110
4212210202321
510042024121
61000414533
7151641414
oct46444271
921020813
1010111161
115786735
123477449
132130348
1414b2b7b
15d4ad76
hex9a48b9

10111161 has 4 divisors (see below), whose sum is σ = 13481552. Its totient is φ = 6740772.

The previous prime is 10111147. The next prime is 10111187. The reversal of 10111161 is 16111101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16111101 = 35370367.

It is not a de Polignac number, because 10111161 - 29 = 10110649 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 210111161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3370390.

The product of its (nonzero) digits is 6, while the sum is 12.

The square root of 10111161 is about 3179.8051827117. The cubic root of 10111161 is about 216.2388262016.

Adding to 10111161 its reverse (16111101), we get a palindrome (26222262).

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

Divisors: 1 3 3370387 10111161