Search a number
-
+
1110201122001 = 31735363615577
BaseRepresentation
bin10000001001111101001…
…001001011110011010001
310221010121211021110101010
4100021331021023303101
5121142142441401001
62210004103001133
7143131550556006
oct20117511136321
93833554243333
101110201122001
11398919654a34
1215b1b81391a9
13808cb35363a
143ba3c2218ad
151dd2b33a8d6
hex1027d24bcd1

1110201122001 has 16 divisors (see below), whose sum is σ = 1567389628224. Its totient is φ = 696575952384.

The previous prime is 1110201121957. The next prime is 1110201122011. The reversal of 1110201122001 is 1002211020111.

It is not a de Polignac number, because 1110201122001 - 29 = 1110201121489 is a prime.

It is a Curzon number.

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

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

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

Almost surely, 21110201122001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 650960.

The product of its (nonzero) digits is 8, while the sum is 12.

Adding to 1110201122001 its reverse (1002211020111), we get a palindrome (2112412142112).

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

Divisors: 1 3 17 51 35363 106089 601171 615577 1803513 1846731 10464809 31394427 21768649451 65305948353 370067040667 1110201122001