Base | Representation |
---|---|
bin | 110110010001111011… |
… | …0011111101011111000 |
3 | 102010212122202021101210 |
4 | 1230203312133223320 |
5 | 3402211243330422 |
6 | 125314405243120 |
7 | 11264414203215 |
oct | 1544366375370 |
9 | 363778667353 |
10 | 116565605112 |
11 | 45487277440 |
12 | 1a7117034a0 |
13 | acb880b048 |
14 | 58db184b0c |
15 | 307370710c |
hex | 1b23d9faf8 |
116565605112 has 128 divisors (see below), whose sum is σ = 337888512000. Its totient is φ = 33138771840.
The previous prime is 116565605059. The next prime is 116565605137. The reversal of 116565605112 is 211506565611.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 403839 + ... + 629457.
It is an arithmetic number, because the mean of its divisors is an integer number (2639754000).
Almost surely, 2116565605112 is an apocalyptic number.
116565605112 is a gapful number since it is divisible by the number (12) 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 116565605112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168944256000).
116565605112 is an abundant number, since it is smaller than the sum of its proper divisors (221322906888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116565605112 is a wasteful number, since it uses less digits than its factorization.
116565605112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225761 (or 225757 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 39.
The spelling of 116565605112 in words is "one hundred sixteen billion, five hundred sixty-five million, six hundred five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •