Base | Representation |
---|---|
bin | 110100101101100101… |
… | …0101111011001101100 |
3 | 101211012000022100211020 |
4 | 1221123022233121230 |
5 | 3323312331120243 |
6 | 124000332454140 |
7 | 11115112001646 |
oct | 1513312573154 |
9 | 354160270736 |
10 | 113198691948 |
11 | 4400978a781 |
12 | 19b3201a350 |
13 | a8a00cb234 |
14 | 569bd4b896 |
15 | 2e27d38283 |
hex | 1a5b2af66c |
113198691948 has 96 divisors (see below), whose sum is σ = 287520522240. Its totient is φ = 34531168320.
The previous prime is 113198691887. The next prime is 113198691953. The reversal of 113198691948 is 849196891311.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 113198691891 and 113198691900.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3965061 + ... + 3993507.
It is an arithmetic number, because the mean of its divisors is an integer number (2995005440).
Almost surely, 2113198691948 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 113198691948, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143760261120).
113198691948 is an abundant number, since it is smaller than the sum of its proper divisors (174321830292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113198691948 is a wasteful number, since it uses less digits than its factorization.
113198691948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29067 (or 29065 counting only the distinct ones).
The product of its digits is 3359232, while the sum is 60.
The spelling of 113198691948 in words is "one hundred thirteen billion, one hundred ninety-eight million, six hundred ninety-one thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •