Base | Representation |
---|---|
bin | 11001101101111101111001… |
… | …100000000111001011010100 |
3 | 112211111012200112100212112220 |
4 | 121231331321200013023110 |
5 | 104311143241030420200 |
6 | 1040322003452142340 |
7 | 32552633204203116 |
oct | 3155757140071324 |
9 | 484435615325486 |
10 | 113110002201300 |
11 | 3304975651a935 |
12 | 10829586a679b0 |
13 | 4b162c58bc1b0 |
14 | 1dd07a64313b6 |
15 | d123b63364a0 |
hex | 66df798072d4 |
113110002201300 has 72 divisors (see below), whose sum is σ = 352439165845536. Its totient is φ = 27842462079360.
The previous prime is 113110002201241. The next prime is 113110002201323. The reversal of 113110002201300 is 3102200011311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 113110002201300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14501278434 + ... + 14501286233.
Almost surely, 2113110002201300 is an apocalyptic number.
113110002201300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113110002201300 is an abundant number, since it is smaller than the sum of its proper divisors (239329163644236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113110002201300 is a wasteful number, since it uses less digits than its factorization.
113110002201300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29002564697 (or 29002564690 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 113110002201300 its reverse (3102200011311), we get a palindrome (116212202212611).
The spelling of 113110002201300 in words is "one hundred thirteen trillion, one hundred ten billion, two million, two hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •