Base | Representation |
---|---|
bin | 110100101100100111… |
… | …1001110111011110000 |
3 | 101211002202101110100012 |
4 | 1221121033032323300 |
5 | 3323231034041443 |
6 | 123553214514052 |
7 | 11114236544150 |
oct | 1513117167360 |
9 | 354082343305 |
10 | 113166315248 |
11 | 43aa2486678 |
12 | 19b23205928 |
13 | a8964a351c |
14 | 5697920760 |
15 | 2e25090118 |
hex | 1a593ceef0 |
113166315248 has 80 divisors (see below), whose sum is σ = 264415933440. Its totient is φ = 45869818368.
The previous prime is 113166315233. The next prime is 113166315259. The reversal of 113166315248 is 842513661311.
It is a happy number.
It is a super-2 number, since 2×1131663152482 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17540 + ... + 476067.
It is an arithmetic number, because the mean of its divisors is an integer number (3305199168).
Almost surely, 2113166315248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113166315248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132207966720).
113166315248 is an abundant number, since it is smaller than the sum of its proper divisors (151249618192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113166315248 is a wasteful number, since it uses less digits than its factorization.
113166315248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493734 (or 493728 counting only the distinct ones).
The product of its digits is 103680, while the sum is 41.
Adding to 113166315248 its reverse (842513661311), we get a palindrome (955679976559).
The spelling of 113166315248 in words is "one hundred thirteen billion, one hundred sixty-six million, three hundred fifteen thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •