Base | Representation |
---|---|
bin | 110100101101111011… |
… | …0010100011111000101 |
3 | 101211012210210202201122 |
4 | 1221123312110133011 |
5 | 3323323242203122 |
6 | 124001421403325 |
7 | 11115311052224 |
oct | 1513366243705 |
9 | 354183722648 |
10 | 113210116037 |
11 | 44015182877 |
12 | 19b35a09545 |
13 | a8a259b055 |
14 | 569d682cbb |
15 | 2e28d43142 |
hex | 1a5bd947c5 |
113210116037 has 8 divisors (see below), whose sum is σ = 116917481472. Its totient is φ = 109506214800.
The previous prime is 113210115971. The next prime is 113210116039. The reversal of 113210116037 is 730611012311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113210116037 - 210 = 113210115013 is a prime.
It is a super-2 number, since 2×1132101160372 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113210115997 and 113210116015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113210116039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 799538 + ... + 930419.
It is an arithmetic number, because the mean of its divisors is an integer number (14614685184).
Almost surely, 2113210116037 is an apocalyptic number.
It is an amenable number.
113210116037 is a deficient number, since it is larger than the sum of its proper divisors (3707365435).
113210116037 is a wasteful number, since it uses less digits than its factorization.
113210116037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1732099.
The product of its (nonzero) digits is 756, while the sum is 26.
Adding to 113210116037 its reverse (730611012311), we get a palindrome (843821128348).
The spelling of 113210116037 in words is "one hundred thirteen billion, two hundred ten million, one hundred sixteen thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •