Search a number
-
+
12111115151 = 73165905687
BaseRepresentation
bin10110100011110000…
…01111001110001111
31011021001012101200102
423101320033032033
5144300421141101
65321435121315
7606060531422
oct132170171617
934231171612
1012111115151
115155455083
12241bba323b
1311b019a635
1482c6a39b9
154ad3bd86b
hex2d1e0f38f

12111115151 has 4 divisors (see below), whose sum is σ = 12277020912. Its totient is φ = 11945209392.

The previous prime is 12111115087. The next prime is 12111115187. The reversal of 12111115151 is 15151111121.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 12111115151 - 26 = 12111115087 is a prime.

It is a super-2 number, since 2×121111151512 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (12111115651) 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 3 ways as a sum of consecutive naturals, for example, 82952771 + ... + 82952916.

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

Almost surely, 212111115151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 165905760.

The product of its digits is 50, while the sum is 20.

Adding to 12111115151 its reverse (15151111121), we get a palindrome (27262226272).

The spelling of 12111115151 in words is "twelve billion, one hundred eleven million, one hundred fifteen thousand, one hundred fifty-one".

Divisors: 1 73 165905687 12111115151