Base | Representation |
---|---|
bin | 11001101110101101100011… |
… | …000101001010010110010101 |
3 | 112211200002202012102010011202 |
4 | 121232231203011022112111 |
5 | 104313013031401121310 |
6 | 1040401304414242245 |
7 | 32556424114251446 |
oct | 3156554305122625 |
9 | 484602665363152 |
10 | 113161165645205 |
11 | 330694209a0577 |
12 | 108374854b6385 |
13 | 4b1b08a6c4262 |
14 | 1dd305b4972cd |
15 | d138acde53a5 |
hex | 66eb6314a595 |
113161165645205 has 8 divisors (see below), whose sum is σ = 135803842088352. Its totient is φ = 90521970306768.
The previous prime is 113161165645159. The next prime is 113161165645207. The reversal of 113161165645205 is 502546561161311.
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 113161165645205 - 210 = 113161165644181 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113161165645205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113161165645207) 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, 870204659 + ... + 870334688.
It is an arithmetic number, because the mean of its divisors is an integer number (16975480261044).
Almost surely, 2113161165645205 is an apocalyptic number.
It is an amenable number.
113161165645205 is a deficient number, since it is larger than the sum of its proper divisors (22642676443147).
113161165645205 is a wasteful number, since it uses less digits than its factorization.
113161165645205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1740552355.
The product of its (nonzero) digits is 648000, while the sum is 47.
The spelling of 113161165645205 in words is "one hundred thirteen trillion, one hundred sixty-one billion, one hundred sixty-five million, six hundred forty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •