Base | Representation |
---|---|
bin | 110100101011011011… |
… | …1011010001101010000 |
3 | 101210222222111102101210 |
4 | 1221112313122031100 |
5 | 3323140341444121 |
6 | 123545233500120 |
7 | 11113244342046 |
oct | 1512667321520 |
9 | 353888442353 |
10 | 113126515536 |
11 | 43a81a72551 |
12 | 19b11a11640 |
13 | a88b179bb8 |
14 | 5692520396 |
15 | 2e2182c876 |
hex | 1a56dda350 |
113126515536 has 40 divisors (see below), whose sum is σ = 294345987040. Its totient is φ = 37437549696.
The previous prime is 113126515517. The next prime is 113126515543. The reversal of 113126515536 is 635515621311.
It is a junction number, because it is equal to n+sod(n) for n = 113126515494 and 113126515503.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8471035 + ... + 8484378.
It is an arithmetic number, because the mean of its divisors is an integer number (7358649676).
Almost surely, 2113126515536 is an apocalyptic number.
113126515536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
113126515536 is an abundant number, since it is smaller than the sum of its proper divisors (181219471504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113126515536 is a wasteful number, since it uses less digits than its factorization.
113126515536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16955563 (or 16955557 counting only the distinct ones).
The product of its digits is 81000, while the sum is 39.
The spelling of 113126515536 in words is "one hundred thirteen billion, one hundred twenty-six million, five hundred fifteen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •