Search a number
-
+
110202201022 = 255101100511
BaseRepresentation
bin110011010100010010…
…0000010001110111110
3101112110011212212000211
41212220210002032332
53301143230413042
6122343131343034
710650625152544
oct1465044021676
9345404785024
10110202201022
11428112a67a1
12194365b1a7a
13a513374c94
145495db9d94
152ceec39017
hex19a89023be

110202201022 has 4 divisors (see below), whose sum is σ = 165303301536. Its totient is φ = 55101100510.

The previous prime is 110202200993. The next prime is 110202201023. The reversal of 110202201022 is 220102202011.

It is a happy number.

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

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110202201023) by changing a digit.

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 as a sum of consecutive naturals, namely, 27550550254 + ... + 27550550257.

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

Almost surely, 2110202201022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55101100513.

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

Adding to 110202201022 its reverse (220102202011), we get a palindrome (330304403033).

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

Divisors: 1 2 55101100511 110202201022