Search a number
-
+
111101011012 = 2271511376511
BaseRepresentation
bin110011101111000100…
…0101110010001000100
3101121202211011010112201
41213132020232101010
53310013324323022
6123012240124244
711012121004045
oct1473610562104
9347684133481
10111101011012
1143132695a72
1219647606684
13a627642b04
14553d5068cc
152d53acd127
hex19de22e444

111101011012 has 24 divisors (see below), whose sum is σ = 197206313472. Its totient is φ = 54756676800.

The previous prime is 111101011001. The next prime is 111101011033. The reversal of 111101011012 is 210110101111.

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

It is an unprimeable number.

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

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

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

Almost surely, 2111101011012 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 81699 (or 81697 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 111101011012 its reverse (210110101111), we get a palindrome (321211112123).

Subtracting 111101011012 from its reverse (210110101111), we obtain a palindrome (99009090099).

The spelling of 111101011012 in words is "one hundred eleven billion, one hundred one million, eleven thousand, twelve".

Divisors: 1 2 4 71 142 284 5113 10226 20452 76511 153022 306044 363023 726046 1452092 5432281 10864562 21729124 391200743 782401486 1564802972 27775252753 55550505506 111101011012