Base | Representation |
---|---|
bin | 11001101111110101101111… |
… | …111011101000001110000000 |
3 | 112211221111212001101222110020 |
4 | 121233311233323220032000 |
5 | 104320300314302124443 |
6 | 1040501045240333440 |
7 | 32565140214104415 |
oct | 3157655773501600 |
9 | 484844761358406 |
10 | 113238690661248 |
11 | 3309929382a569 |
12 | 1084a500474280 |
13 | 4b25493b48209 |
14 | 1dd6ad365410c |
15 | d158e8e7a583 |
hex | 66fd6fee8380 |
113238690661248 has 32 divisors (see below), whose sum is σ = 300790272069960. Its totient is φ = 37746230220288.
The previous prime is 113238690661223. The next prime is 113238690661273. The reversal of 113238690661248 is 842166096832311.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (113238690661223) and next prime (113238690661273).
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 113238690661191 and 113238690661200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 147446211415 + ... + 147446212182.
Almost surely, 2113238690661248 is an apocalyptic number.
It is an amenable number.
113238690661248 is an abundant number, since it is smaller than the sum of its proper divisors (187551581408712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113238690661248 is an equidigital number, since it uses as much as digits as its factorization.
113238690661248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294892423614 (or 294892423602 counting only the distinct ones).
The product of its (nonzero) digits is 17915904, while the sum is 60.
The spelling of 113238690661248 in words is "one hundred thirteen trillion, two hundred thirty-eight billion, six hundred ninety million, six hundred sixty-one thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •