Search a number
-
+
1110001211001 = 3341111155963
BaseRepresentation
bin10000001001110001001…
…110100101011001111001
310221010002220002221001000
4100021301032211121321
5121141240302223001
62205532202115213
7143123602422054
oct20116116453171
93833086087030
101110001211001
11398826822931
1215b1611abb09
1380898aca9c7
143ba1d863a9b
151dd189eca86
hex102713a5679

1110001211001 has 8 divisors (see below), whose sum is σ = 1644446238560. Its totient is φ = 740000807316.

The previous prime is 1110001210979. The next prime is 1110001211027. The reversal of 1110001211001 is 1001121000111.

It is not a de Polignac number, because 1110001211001 - 29 = 1110001210489 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

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

Almost surely, 21110001211001 is an apocalyptic number.

It is an amenable number.

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

1110001211001 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 1110001211001 its reverse (1001121000111), we get a palindrome (2111122211112).

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

Divisors: 1 3 9 27 41111155963 123333467889 370000403667 1110001211001