Search a number
-
+
111001099022 = 2115045504501
BaseRepresentation
bin110011101100000101…
…1100101101100001110
3101121111212011002001122
41213120023211230032
53304312240132042
6122554310440542
711006465526332
oct1473013455416
9347455132048
10111001099022
1143091254680
121961a063152
13a60ca303a8
1455301397c2
152d49e447d2
hex19d82e5b0e

111001099022 has 8 divisors (see below), whose sum is σ = 181638162072. Its totient is φ = 50455045000.

The previous prime is 111001098991. The next prime is 111001099051. The reversal of 111001099022 is 220990100111.

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

It is a junction number, because it is equal to n+sod(n) for n = 111001098982 and 111001099000.

It is a congruent number.

It is an unprimeable number.

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, 2522752229 + ... + 2522752272.

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

Almost surely, 2111001099022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5045504514.

The product of its (nonzero) digits is 324, while the sum is 26.

Adding to 111001099022 its reverse (220990100111), we get a palindrome (331991199133).

The spelling of 111001099022 in words is "one hundred eleven billion, one million, ninety-nine thousand, twenty-two".

Divisors: 1 2 11 22 5045504501 10091009002 55500549511 111001099022