Search a number
-
+
110110101102001 = 721113233533735189
BaseRepresentation
bin11001000010010100000001…
…011101100101110110110001
3112102212102102021012021100201
4121002110001131211312301
5103413020441340231001
61030103514312315201
732123122644452200
oct3102240135456661
9472772367167321
10110110101102001
11320a2482564780
12104240aa0a2b01
134959451709620
141d29500721237
15cae33a62b501
hex642501765db1

110110101102001 has 192 divisors, whose sum is σ = 157920169397760. Its totient is φ = 75324938895360.

The previous prime is 110110101101983. The next prime is 110110101102017. The reversal of 110110101102001 is 100201101011011.

It is not a de Polignac number, because 110110101102001 - 211 = 110110101099953 is a prime.

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 21219905115 + ... + 21219910303.

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

Almost surely, 2110110101102001 is an apocalyptic number.

110110101102001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

Adding to 110110101102001 its reverse (100201101011011), we get a palindrome (210311202113012).

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