Search a number
-
+
110002101102 = 2326111227839
BaseRepresentation
bin110011001110010100…
…0101101101101101110
3101111221020100201112200
41212130220231231232
53300241014213402
6122311222442330
710642645301055
oct1463450555556
9344836321480
10110002101102
1142719355763
121939b5933a6
13a4b0a8436a
1454775ad39c
152cdc3b021c
hex199ca2db6e

110002101102 has 12 divisors (see below), whose sum is σ = 238337885760. Its totient is φ = 36667367028.

The previous prime is 110002101031. The next prime is 110002101119. The reversal of 110002101102 is 201101200011.

It is a happy number.

It is a super-2 number, since 2×1100021011022 (a number of 23 digits) contains 22 as substring.

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 polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3055613902 + ... + 3055613937.

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

Almost surely, 2110002101102 is an apocalyptic number.

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

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

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

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

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

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

Adding to 110002101102 its reverse (201101200011), we get a palindrome (311103301113).

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

Divisors: 1 2 3 6 9 18 6111227839 12222455678 18333683517 36667367034 55001050551 110002101102