Search a number
-
+
110011100102 = 2531037840567
BaseRepresentation
bin110011001110100101…
…1000010101111000110
3101111221212021220211222
41212131023002233012
53300300320200402
6122312143400342
710643114631161
oct1463513025706
9344855256758
10110011100102
1142723441852
12193a25b30b2
13a4b28b5407
145478872ad8
152cdd08b7a2
hex199d2c2bc6

110011100102 has 8 divisors (see below), whose sum is σ = 168130172016. Its totient is φ = 53967709432.

The previous prime is 110011100063. The next prime is 110011100117. The reversal of 110011100102 is 201001110011.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a self number, because there is not a number n which added to its sum of digits gives 110011100102.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 518920178 + ... + 518920389.

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

Almost surely, 2110011100102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1037840622.

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 110011100102 its reverse (201001110011), we get a palindrome (311012210113).

Subtracting 110011100102 from its reverse (201001110011), we obtain a palindrome (90990009909).

The spelling of 110011100102 in words is "one hundred ten billion, eleven million, one hundred thousand, one hundred two".

Divisors: 1 2 53 106 1037840567 2075681134 55005550051 110011100102