Search a number
-
+
110002113000 = 23325313940189
BaseRepresentation
bin110011001110010100…
…0110000100111101000
3101111221020101022212100
41212130220300213220
53300241020104000
6122311223013400
710642645350543
oct1463450604750
9344836338770
10110002113000
114271936369a
121939b59a260
13a4b0a898c0
1454775b385a
152cdc3b3a00
hex199ca309e8

110002113000 has 192 divisors, whose sum is σ = 400408117200. Its totient is φ = 27077414400.

The previous prime is 110002112981. The next prime is 110002113031. The reversal of 110002113000 is 311200011.

It can be written as a sum of positive squares in 8 ways, for example, as 4547344356 + 105454768644 = 67434^2 + 324738^2 .

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

It is an unprimeable number.

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 47 ways as a sum of consecutive naturals, for example, 353095 + ... + 587094.

Almost surely, 2110002113000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 110002113000 its reverse (311200011), we get a palindrome (110313313011).

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