Search a number
-
+
110311202122 = 2115014145551
BaseRepresentation
bin110011010111100001…
…1110101110101001010
3101112201202222200102121
41212233003311311022
53301404131431442
6122402023521454
710653420514162
oct1465703656512
9345652880377
10110311202122
1142867885950
1219466bb928a
13a52cb1a784
1454a66715a2
152d095ba967
hex19af0f5d4a

110311202122 has 8 divisors (see below), whose sum is σ = 180509239872. Its totient is φ = 50141455500.

The previous prime is 110311202087. The next prime is 110311202159. The reversal of 110311202122 is 221202113011.

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

It is a super-2 number, since 2×1103112021222 (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 110311202096 and 110311202105.

It is an unprimeable number.

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

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

Almost surely, 2110311202122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5014145564.

The product of its (nonzero) digits is 48, while the sum is 16.

Adding to 110311202122 its reverse (221202113011), we get a palindrome (331513315133).

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

Divisors: 1 2 11 22 5014145551 10028291102 55155601061 110311202122