Search a number
-
+
1102200055 = 51147426383
BaseRepresentation
bin100000110110010…
…0011110011110111
32211210222120020021
41001230203303313
54224130400210
6301211550011
736212355145
oct10154436367
92753876207
101102200055
11516188240
1226915b307
131474711a8
14a6552595
1566b6cbda
hex41b23cf7

1102200055 has 16 divisors (see below), whose sum is σ = 1473583104. Its totient is φ = 784542880.

The previous prime is 1102200053. The next prime is 1102200059. The reversal of 1102200055 is 5500022011.

It is not a de Polignac number, because 1102200055 - 21 = 1102200053 is a prime.

It is a super-2 number, since 2×11022000552 = 2429689922484006050, which contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1102200053) 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 in 15 ways as a sum of consecutive naturals, for example, 210607 + ... + 215776.

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

Almost surely, 21102200055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 426446.

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

The square root of 1102200055 is about 33199.3984132243. The cubic root of 1102200055 is about 1032.9678610997.

Adding to 1102200055 its reverse (5500022011), we get a palindrome (6602222066).

The spelling of 1102200055 in words is "one billion, one hundred two million, two hundred thousand, fifty-five".

Divisors: 1 5 11 47 55 235 517 2585 426383 2131915 4690213 20040001 23451065 100200005 220440011 1102200055