Search a number
-
+
1102200211022 = 2551100105511
BaseRepresentation
bin10000000010100000010…
…000001000011001001110
310220100222020011001211212
4100002200100020121032
5121024301223223042
62202202131414422
7142426356132641
oct20024020103116
93810866131755
101102200211022
11395493315109
12159744754412
137cc248819a1
143b4bd79ba58
151da0dc10482
hex100a040864e

1102200211022 has 4 divisors (see below), whose sum is σ = 1653300316536. Its totient is φ = 551100105510.

The previous prime is 1102200210997. The next prime is 1102200211043. The reversal of 1102200211022 is 2201120022011.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 21102200211022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 551100105513.

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

Adding to 1102200211022 its reverse (2201120022011), we get a palindrome (3303320233033).

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

Divisors: 1 2 551100105511 1102200211022