Base | Representation |
---|---|
bin | 11001011111010010011000… |
… | …011000101101111111111100 |
3 | 112200220202210120202212010002 |
4 | 121133102120120231333330 |
5 | 104143131230434323200 |
6 | 1034230325353133432 |
7 | 32420021212632233 |
oct | 3137223030557774 |
9 | 480822716685102 |
10 | 112101203042300 |
11 | 3279a94271060a |
12 | 106a5b6a0ba278 |
13 | 4a721376633c4 |
14 | 1d97a27533b1a |
15 | ce6022366bd5 |
hex | 65f49862dffc |
112101203042300 has 72 divisors (see below), whose sum is σ = 244912899696192. Its totient is φ = 44536687360000.
The previous prime is 112101203042299. The next prime is 112101203042333. The reversal of 112101203042300 is 3240302101211.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 3344285 + ... + 15342315.
It is an arithmetic number, because the mean of its divisors is an integer number (3401568051336).
Almost surely, 2112101203042300 is an apocalyptic number.
112101203042300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112101203042300 is an abundant number, since it is smaller than the sum of its proper divisors (132811696653892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112101203042300 is a wasteful number, since it uses less digits than its factorization.
112101203042300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11998679 (or 11998672 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112101203042300 its reverse (3240302101211), we get a palindrome (115341505143511).
The spelling of 112101203042300 in words is "one hundred twelve trillion, one hundred one billion, two hundred three million, forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •