Search a number
-
+
111104153211 = 32313147122477
BaseRepresentation
bin110011101111001010…
…0101101011001111011
3101121210001001202211110
41213132110231121323
53310020130400321
6123012431331403
711012156502012
oct1473624553173
9347701052743
10111104153211
1143134441827
1219648680b63
13a6281a30bc
14553dac3a79
152d53eee176
hex19de52d67b

111104153211 has 16 divisors (see below), whose sum is σ = 154592711424. Its totient is φ = 70843057824.

The previous prime is 111104153207. The next prime is 111104153227. The reversal of 111104153211 is 112351401111.

It is not a de Polignac number, because 111104153211 - 22 = 111104153207 is a prime.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 845905 + ... + 968381.

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

Almost surely, 2111104153211 is an apocalyptic number.

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

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

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

The sum of its prime factors is 135650.

The product of its (nonzero) digits is 120, while the sum is 21.

Adding to 111104153211 its reverse (112351401111), we get a palindrome (223455554322).

The spelling of 111104153211 in words is "one hundred eleven billion, one hundred four million, one hundred fifty-three thousand, two hundred eleven".

Divisors: 1 3 23 69 13147 39441 122477 302381 367431 907143 2816971 8450913 1610205119 4830615357 37034717737 111104153211