Search a number
-
+
1092001821111 = 3340444511893
BaseRepresentation
bin11111110010000000110…
…00010111000110110111
310212101122111002011221000
433321000120113012313
5120342404431233421
62153354140454343
7141615552220515
oct17710030270667
93771574064830
101092001821111
1139112a6178a3
1215777924a3b3
137bc8aa52046
143abd31554b5
151d613715226
hexfe406171b7

1092001821111 has 8 divisors (see below), whose sum is σ = 1617780475760. Its totient is φ = 728001214056.

The previous prime is 1092001821103. The next prime is 1092001821151. The reversal of 1092001821111 is 1111281002901.

It is not a de Polignac number, because 1092001821111 - 23 = 1092001821103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 40444511893 = 1092001821111 / (1 + 0 + 9 + 2 + 0 + 0 + 1 + 8 + 2 + 1 + 1 + 1 + 1).

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20222255920 + ... + 20222255973.

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

Almost surely, 21092001821111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 288, while the sum is 27.

The spelling of 1092001821111 in words is "one trillion, ninety-two billion, one million, eight hundred twenty-one thousand, one hundred eleven".

Divisors: 1 3 9 27 40444511893 121333535679 364000607037 1092001821111