Search a number
-
+
110111120001 = 3255511220399
BaseRepresentation
bin110011010001100100…
…0100101101010000001
3101112012211111110100200
41212203020211222001
53301001421320001
6122330115235413
710645441035321
oct1464310455201
9345184443320
10110111120001
1142774947223
121940bba8b69
13a4ca534c9c
145487c6b281
152ce6c47086
hex19a3225a81

110111120001 has 12 divisors (see below), whose sum is σ = 159052982400. Its totient is φ = 73405757880.

The previous prime is 110111119981. The next prime is 110111120027. The reversal of 110111120001 is 100021111011.

It is a de Polignac number, because none of the positive numbers 2k-110111120001 is a prime.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 389400 + ... + 609798.

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

Almost surely, 2110111120001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110111120001 its reverse (100021111011), we get a palindrome (210132231012).

The spelling of 110111120001 in words is "one hundred ten billion, one hundred eleven million, one hundred twenty thousand, one".

Divisors: 1 3 9 55511 166533 220399 499599 661197 1983591 12234568889 36703706667 110111120001