Search a number
-
+
110661608064 = 2737376716607
BaseRepresentation
bin110011100001111110…
…0100010001010000000
3101120122012100011000110
41213003330202022000
53303113332424224
6122500502151320
710665204101640
oct1470374421200
9346565304013
10110661608064
1142a27658037
1219544422540
13a5875b6677
1454db006520
152d2a234929
hex19c3f22280

110661608064 has 256 divisors, whose sum is σ = 350186987520. Its totient is φ = 30302097408.

The previous prime is 110661608063. The next prime is 110661608081. The reversal of 110661608064 is 460806166011.

It is a super-3 number, since 3×1106616080643 (a number of 34 digits) contains 333 as substring.

It is not an unprimeable number, because it can be changed into a prime (110661608063) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6655249 + ... + 6671855.

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

Almost surely, 2110661608064 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110661608064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175093493760).

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

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

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

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

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

The product of its (nonzero) digits is 41472, while the sum is 39.

The spelling of 110661608064 in words is "one hundred ten billion, six hundred sixty-one million, six hundred eight thousand, sixty-four".