Search a number
-
+
110132001111 = 3113337333367
BaseRepresentation
bin110011010010001100…
…0001111100101010111
3101112021021210022212010
41212210120033211113
53301022243013421
6122332142555303
710646113364226
oct1464430174527
9345237708763
10110132001111
1142785709540
1219416b98b33
13a501966482
14548a944cbd
152ce89be076
hex19a460f957

110132001111 has 8 divisors (see below), whose sum is σ = 160192001664. Its totient is φ = 66746667320.

The previous prime is 110132001073. The next prime is 110132001121. The reversal of 110132001111 is 111100231011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 110132001111 - 29 = 110132000599 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110132001121) 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, 1668666651 + ... + 1668666716.

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

Almost surely, 2110132001111 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 3337333381.

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

Adding to 110132001111 its reverse (111100231011), we get a palindrome (221232232122).

The spelling of 110132001111 in words is "one hundred ten billion, one hundred thirty-two million, one thousand, one hundred eleven".

Divisors: 1 3 11 33 3337333367 10012000101 36710667037 110132001111