Base | Representation |
---|---|
bin | 110100110000010111… |
… | …1000101011101000001 |
3 | 101211102112002021011210 |
4 | 1221200233011131001 |
5 | 3324010234334122 |
6 | 124013511000333 |
7 | 11120325002532 |
oct | 1514057053501 |
9 | 354375067153 |
10 | 113292105537 |
11 | 44057492796 |
12 | 19b593690a9 |
13 | a8b6576b50 |
14 | 56aa506689 |
15 | 2e3113b40c |
hex | 1a60bc5741 |
113292105537 has 32 divisors (see below), whose sum is σ = 170601984000. Its totient is φ = 66351776832.
The previous prime is 113292105499. The next prime is 113292105569. The reversal of 113292105537 is 735501292311.
It is not a de Polignac number, because 113292105537 - 26 = 113292105473 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 113292105495 and 113292105504.
It is not an unprimeable number, because it can be changed into a prime (113292105587) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 138837 + ... + 495842.
It is an arithmetic number, because the mean of its divisors is an integer number (5331312000).
Almost surely, 2113292105537 is an apocalyptic number.
It is an amenable number.
113292105537 is a deficient number, since it is larger than the sum of its proper divisors (57309878463).
113292105537 is a wasteful number, since it uses less digits than its factorization.
113292105537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634917.
The product of its (nonzero) digits is 56700, while the sum is 39.
Adding to 113292105537 its reverse (735501292311), we get a palindrome (848793397848).
The spelling of 113292105537 in words is "one hundred thirteen billion, two hundred ninety-two million, one hundred five thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •