Search a number
-
+
110110111201 = 3123339152189
BaseRepresentation
bin110011010001100010…
…0101111010111100001
3101112012202121012112201
41212203010233113201
53301001142024301
6122330041453201
710645426334236
oct1464304572741
9345182535481
10110110111201
1142774318302
121940b7a1201
13a4ca270a6c
145487a8778d
152ce6ae8201
hex19a312f5e1

110110111201 has 8 divisors (see below), whose sum is σ = 113667667200. Its totient is φ = 106552906320.

The previous prime is 110110111183. The next prime is 110110111249. The reversal of 110110111201 is 102111011011.

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 110110111201 - 25 = 110110111169 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2110110111201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 175559.

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

Adding to 110110111201 its reverse (102111011011), we get a palindrome (212221122212).

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

Divisors: 1 31 23339 152189 723509 4717859 3551939071 110110111201