Search a number
-
+
110110211122 = 2343131604497
BaseRepresentation
bin110011010001100010…
…1000111110000110010
3101112012202210021121111
41212203011013300302
53301001203223442
6122330043543534
710645430231452
oct1464305076062
9345182707544
10110110211122
114277438638a
121940b82abaa
13a4ca2a73a2
145487ab1d62
152ce6b17b17
hex19a3147c32

110110211122 has 8 divisors (see below), whose sum is σ = 165170233116. Its totient is φ = 55053466752.

The previous prime is 110110211119. The next prime is 110110211171. The reversal of 110110211122 is 221112011011.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 91373802961 + 18736408161 = 302281^2 + 136881^2 .

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

It is a super-3 number, since 3×1101102111223 (a number of 34 digits) contains 333 as substring.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 733623 + ... + 870874.

Almost surely, 2110110211122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1638812.

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 110110211122 its reverse (221112011011), we get a palindrome (331222222133).

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

Divisors: 1 2 34313 68626 1604497 3208994 55055105561 110110211122