Search a number
-
+
1101102102 = 232292109391
BaseRepresentation
bin100000110100001…
…0111110000010110
32211201220210010100
41001220113300112
54223340231402
6301132234530
736200133132
oct10150276026
92751823110
101101102102
115155a8341
1226890ba46
13147178509
14a63483c2
1566a0271c
hex41a17c16

1101102102 has 24 divisors (see below), whose sum is σ = 2467988640. Its totient is φ = 354377520.

The previous prime is 1101102049. The next prime is 1101102127. The reversal of 1101102102 is 2012011011.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1054174 + ... + 1055217.

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

Almost surely, 21101102102 is an apocalyptic number.

1101102102 is an abundant number, since it is smaller than the sum of its proper divisors (1366886538).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 2109428 (or 2109425 counting only the distinct ones).

The product of its (nonzero) digits is 4, while the sum is 9.

The square root of 1101102102 is about 33182.8585567910. The cubic root of 1101102102 is about 1032.6247512868.

Adding to 1101102102 its reverse (2012011011), we get a palindrome (3113113113).

The spelling of 1101102102 in words is "one billion, one hundred one million, one hundred two thousand, one hundred two".

Divisors: 1 2 3 6 9 18 29 58 87 174 261 522 2109391 4218782 6328173 12656346 18984519 37969038 61172339 122344678 183517017 367034034 550551051 1101102102