Base | Representation |
---|---|
bin | 11001101111110111000110… |
… | …011100000111110110100000 |
3 | 112211221122121012101122101002 |
4 | 121233313012130013312200 |
5 | 104320311302324120000 |
6 | 1040501445244131132 |
7 | 32565221166334142 |
oct | 3157670634076640 |
9 | 484848535348332 |
10 | 113240142020000 |
11 | 33099969007906 |
12 | 1084a846536aa8 |
13 | 4b25665739688 |
14 | 1dd6bd02d4c92 |
15 | d159815b78d5 |
hex | 66fdc6707da0 |
113240142020000 has 60 divisors (see below), whose sum is σ = 278587735439706. Its totient is φ = 45296056800000.
The previous prime is 113240142019981. The next prime is 113240142020029. The reversal of 113240142020000 is 20241042311.
It can be written as a sum of positive squares in 5 ways, for example, as 2211014354704 + 111029127665296 = 1486948^2 + 10537036^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2830983551 + ... + 2831023550.
Almost surely, 2113240142020000 is an apocalyptic number.
113240142020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113240142020000 is an abundant number, since it is smaller than the sum of its proper divisors (165347593419706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113240142020000 is an frugal number, since it uses more digits than its factorization.
113240142020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5662007131 (or 5662007108 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 113240142020000 its reverse (20241042311), we get a palindrome (113260383062311).
The spelling of 113240142020000 in words is "one hundred thirteen trillion, two hundred forty billion, one hundred forty-two million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •