Search a number
-
+
110310010022 = 255155005011
BaseRepresentation
bin110011010111011111…
…1010010110010100110
3101112201200202010011202
41212232333102302212
53301403330310042
6122401542202502
710653404420522
oct1465677226246
9345650663152
10110310010022
1142867141243
1219466723432
13a52c7c0ca4
1454a6440d82
152d09432632
hex19aefd2ca6

110310010022 has 4 divisors (see below), whose sum is σ = 165465015036. Its totient is φ = 55155005010.

The previous prime is 110310010007. The next prime is 110310010061. The reversal of 110310010022 is 220010013011.

It is a semiprime because it is the product of two primes.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27577502504 + ... + 27577502507.

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

Almost surely, 2110310010022 is an apocalyptic number.

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

110310010022 is an equidigital number, since it uses as much as digits as its factorization.

110310010022 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 55155005013.

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

Adding to 110310010022 its reverse (220010013011), we get a palindrome (330320023033).

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

Divisors: 1 2 55155005011 110310010022