Search a number
-
+
111130101322 = 2509722915101
BaseRepresentation
bin110011101111111011…
…1101100011001001010
3101121211211220001221121
41213133313230121022
53310043301220242
6123015155425454
711012623163332
oct1473767543112
9347754801847
10111130101322
1143148054a49
12196552b528a
13a630689a06
14554331a0c2
152d56427667
hex19dfdec64a

111130101322 has 16 divisors (see below), whose sum is σ = 167056813800. Its totient is φ = 55444542400.

The previous prime is 111130101307. The next prime is 111130101353. The reversal of 111130101322 is 223101031111.

It is a happy number.

It can be written as a sum of positive squares in 4 ways, for example, as 110622094801 + 508006521 = 332599^2 + 22539^2 .

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

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 7351572 + ... + 7366672.

Almost surely, 2111130101322 is an apocalyptic number.

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

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

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

The sum of its prime factors is 22841.

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 111130101322 its reverse (223101031111), we get a palindrome (334231132433).

The spelling of 111130101322 in words is "one hundred eleven billion, one hundred thirty million, one hundred one thousand, three hundred twenty-two".

Divisors: 1 2 509 1018 7229 14458 15101 30202 3679561 7359122 7686409 15372818 109165129 218330258 55565050661 111130101322