Base | Representation |
---|---|
bin | 110100110111110101… |
… | …1110011011001100000 |
3 | 101212002000000010011020 |
4 | 1221233223303121200 |
5 | 3330013440402032 |
6 | 124054430245440 |
7 | 11126461516602 |
oct | 1515753633140 |
9 | 355060003136 |
10 | 113542903392 |
11 | 44176010946 |
12 | 1a009356880 |
13 | a926508749 |
14 | 56d194d172 |
15 | 2e4817bb2c |
hex | 1a6faf3660 |
113542903392 has 96 divisors (see below), whose sum is σ = 303483075840. Its totient is φ = 37159979520.
The previous prime is 113542903361. The next prime is 113542903489. The reversal of 113542903392 is 293309245311.
It is a tau number, because it is divible by the number of its divisors (96).
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, 3279709 + ... + 3314147.
It is an arithmetic number, because the mean of its divisors is an integer number (3161282040).
Almost surely, 2113542903392 is an apocalyptic number.
113542903392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113542903392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151741537920).
113542903392 is an abundant number, since it is smaller than the sum of its proper divisors (189940172448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113542903392 is a wasteful number, since it uses less digits than its factorization.
113542903392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35076 (or 35068 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 42.
The spelling of 113542903392 in words is "one hundred thirteen billion, five hundred forty-two million, nine hundred three thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •