Search a number
-
+
16056115111 = 32534935787
BaseRepresentation
bin11101111010000010…
…01101111110100111
31112102222102011021001
432331001031332213
5230340331140421
611213122134131
71105612504141
oct167501157647
945388364231
1016056115111
11689a292a23
1231411b1347
13168b5a2b3a
14ac45bbc91
1563e8cc691
hex3bd04dfa7

16056115111 has 4 divisors (see below), whose sum is σ = 16061054152. Its totient is φ = 16051176072.

The previous prime is 16056115073. The next prime is 16056115151. The reversal of 16056115111 is 11151165061.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11151165061 = 51637215953.

It is a cyclic number.

It is not a de Polignac number, because 16056115111 - 229 = 15519244199 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 16056115111.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (16056115151) 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, 2464641 + ... + 2471146.

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

Almost surely, 216056115111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4939040.

The product of its (nonzero) digits is 900, while the sum is 28.

The spelling of 16056115111 in words is "sixteen billion, fifty-six million, one hundred fifteen thousand, one hundred eleven".

Divisors: 1 3253 4935787 16056115111