Search a number
-
+
113165085696 = 21031397131223
BaseRepresentation
bin110100101100100101…
…0100010110000000000
3101211002200001222201020
41221121022202300000
53323230230220241
6123553132305440
711114223233355
oct1513112426000
9354080058636
10113165085696
1143aa1816913
1219b22912280
13a896162990
1456976c062c
152e24deab66
hex1a592a2c00

113165085696 has 352 divisors, whose sum is σ = 332165019648. Its totient is φ = 34044641280.

The previous prime is 113165085667. The next prime is 113165085701. The reversal of 113165085696 is 696580561311.

It is an unprimeable number.

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

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

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

Almost surely, 2113165085696 is an apocalyptic number.

113165085696 is a gapful number since it is divisible by the number (16) 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 113165085696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166082509824).

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

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

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

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

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

The product of its (nonzero) digits is 1166400, while the sum is 51.

The spelling of 113165085696 in words is "one hundred thirteen billion, one hundred sixty-five million, eighty-five thousand, six hundred ninety-six".