Search a number
-
+
111022210122002 = 21912213131330347
BaseRepresentation
bin11001001111100101011111…
…011001011000000100010010
3112120002121201201020022021022
4121033211133121120010102
5104022441441242401002
61032042522122155442
732246042602300064
oct3117453731300422
9476077651208238
10111022210122002
11324142892a8513
1210550a21652b82
1349c4470aab50a
141d5b709dc3734
15cc7e20c60ba2
hex64f95f658112

111022210122002 has 16 divisors (see below), whose sum is σ = 167480864911872. Its totient is φ = 55195517816880.

The previous prime is 111022210122001. The next prime is 111022210122013. The reversal of 111022210122002 is 200221012220111.

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

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

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

Almost surely, 2111022210122002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 131332753.

The product of its (nonzero) digits is 64, while the sum is 17.

Adding to 111022210122002 its reverse (200221012220111), we get a palindrome (311243222342113).

The spelling of 111022210122002 in words is "one hundred eleven trillion, twenty-two billion, two hundred ten million, one hundred twenty-two thousand, two".

Divisors: 1 2 191 382 2213 4426 422683 845366 131330347 262660694 25084096277 50168192554 290634057911 581268115822 55511105061001 111022210122002