Search a number
-
+
10161140111 = 65917778677
BaseRepresentation
bin10010111011010011…
…01011000110001111
3222020010222101210122
421131221223012033
5131302222440421
64400140255155
7506542160123
oct113551530617
928203871718
1010161140111
114344775a61
121b76b414bb
13c5c1b9b55
146c570b583
153e70dd2ab
hex25da6b18f

10161140111 has 8 divisors (see below), whose sum is σ = 10183459440. Its totient is φ = 10138843008.

The previous prime is 10161140071. The next prime is 10161140113. The reversal of 10161140111 is 11104116101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1166705 + ... + 1175381.

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

Almost surely, 210161140111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11113.

The product of its (nonzero) digits is 24, while the sum is 17.

Adding to 10161140111 its reverse (11104116101), we get a palindrome (21265256212).

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

Divisors: 1 659 1777 8677 1171043 5718143 15419029 10161140111