Base | Representation |
---|---|
bin | 110100111110010011… |
… | …1101100011010010000 |
3 | 101212122010101012200202 |
4 | 1221330213230122100 |
5 | 3330440020230000 |
6 | 124132142034332 |
7 | 11135035310333 |
oct | 1517447543220 |
9 | 355563335622 |
10 | 113759930000 |
11 | 44277573182 |
12 | 1a069b789a8 |
13 | a95c474962 |
14 | 57126c461a |
15 | 2e5c24add5 |
hex | 1a7c9ec690 |
113759930000 has 50 divisors (see below), whose sum is σ = 275424190734. Its totient is φ = 45503968000.
The previous prime is 113759929993. The next prime is 113759930023. The reversal of 113759930000 is 39957311.
113759930000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 5 ways, for example, as 72333026704 + 41426903296 = 268948^2 + 203536^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5677997 + ... + 5697996.
Almost surely, 2113759930000 is an apocalyptic number.
113759930000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113759930000 is an abundant number, since it is smaller than the sum of its proper divisors (161664260734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113759930000 is an equidigital number, since it uses as much as digits as its factorization.
113759930000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11376021 (or 11376000 counting only the distinct ones).
The product of its (nonzero) digits is 25515, while the sum is 38.
The spelling of 113759930000 in words is "one hundred thirteen billion, seven hundred fifty-nine million, nine hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •