Search a number
-
+
1102201020022 = 2551100510011
BaseRepresentation
bin10000000010100000010…
…011001101111001110110
310220100222021200011120211
4100002200103031321312
5121024301430120042
62202202201020034
7142426366042354
oct20024023157166
93810867604524
101102201020022
11395493817a03
12159744a8461a
137cc24aa5c9b
143b4bd92c7d4
151da0dd20017
hex100a04cde76

1102201020022 has 4 divisors (see below), whose sum is σ = 1653301530036. Its totient is φ = 551100510010.

The previous prime is 1102201019939. The next prime is 1102201020047. The reversal of 1102201020022 is 2200201022011.

It is a happy number.

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 = 1102201019984 and 1102201020011.

It is a congruent number.

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

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

Almost surely, 21102201020022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 551100510013.

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

Adding to 1102201020022 its reverse (2200201022011), we get a palindrome (3302402042033).

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

Divisors: 1 2 551100510011 1102201020022