Search a number
-
+
1102011075 = 36521123239
BaseRepresentation
bin100000110101111…
…0101101011000011
32211210121222000000
41001223311223003
54224103323300
6301203531043
736210640164
oct10153655303
92753558000
101102011075
11516069260
12269089a83
13147406179
14a650376b
1566b31c00
hex41af5ac3

1102011075 has 168 divisors, whose sum is σ = 2341992960. Its totient is φ = 508939200.

The previous prime is 1102011067. The next prime is 1102011091. The reversal of 1102011075 is 5701102011.

It is a happy number.

1102011075 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 1102011075 - 23 = 1102011067 is a prime.

It is an unprimeable number.

It is a polite number, since it can be written in 167 ways as a sum of consecutive naturals, for example, 4610806 + ... + 4611044.

Almost surely, 21102011075 is an apocalyptic number.

1102011075 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

1102011075 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 70, while the sum is 18.

The square root of 1102011075 is about 33196.5521553067. The cubic root of 1102011075 is about 1032.9088211752.

Adding to 1102011075 its reverse (5701102011), we get a palindrome (6803113086).

The spelling of 1102011075 in words is "one billion, one hundred two million, eleven thousand, seventy-five".