Base | Representation |
---|---|
bin | 11001110011101010010001… |
… | …110111011101101101000000 |
3 | 112212212121120110202202200010 |
4 | 121303222101313131231000 |
5 | 104334101031232000000 |
6 | 1041221431130424520 |
7 | 32623123600132455 |
oct | 3163522167355500 |
9 | 485777513682603 |
10 | 113501253000000 |
11 | 3318a67a38a858 |
12 | 10891377b92140 |
13 | 4b4417870c338 |
14 | 20056c062582c |
15 | d1c664a93d50 |
hex | 673a91dddb40 |
113501253000000 has 392 divisors, whose sum is σ = 376345792087200. Its totient is φ = 30188883200000.
The previous prime is 113501252999987. The next prime is 113501253000007. The reversal of 113501253000000 is 352105311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113501253000007) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1166951371 + ... + 1167048629.
Almost surely, 2113501253000000 is an apocalyptic number.
113501253000000 is a gapful number since it is divisible by the number (10) 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 113501253000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188172896043600).
113501253000000 is an abundant number, since it is smaller than the sum of its proper divisors (262844539087200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113501253000000 is an frugal number, since it uses more digits than its factorization.
113501253000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97693 (or 97658 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
The spelling of 113501253000000 in words is "one hundred thirteen trillion, five hundred one billion, two hundred fifty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •