Search a number
-
+
110114705064 = 2337131716691777
BaseRepresentation
bin110011010001101011…
…0010000111010101000
3101112020002020121010210
41212203112100322220
53301003331030224
6122330324141120
710645513356360
oct1464326207250
9345202217123
10110114705064
1142776975791
12194112377a0
13a4cb1bba20
1454885219a0
152ce7204429
hex19a3590ea8

110114705064 has 256 divisors, whose sum is σ = 359161689600. Its totient is φ = 27301183488.

The previous prime is 110114705059. The next prime is 110114705117. The reversal of 110114705064 is 460507411011.

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 63 ways as a sum of consecutive naturals, for example, 61965744 + ... + 61967520.

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

Almost surely, 2110114705064 is an apocalyptic number.

110114705064 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 110114705064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179580844800).

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

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

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

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

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

The product of its (nonzero) digits is 3360, while the sum is 30.

The spelling of 110114705064 in words is "one hundred ten billion, one hundred fourteen million, seven hundred five thousand, sixty-four".