Base | Representation |
---|---|
bin | 11001011111011010101011… |
… | …111000010010100011101000 |
3 | 112200221121211000122021012211 |
4 | 121133122223320102203220 |
5 | 104143303011211121300 |
6 | 1034234402251014504 |
7 | 32420455166662321 |
oct | 3137325370224350 |
9 | 480847730567184 |
10 | 112110120020200 |
11 | 327a36a9057035 |
12 | 106a783843a434 |
13 | 4a72c28b658a3 |
14 | 1d982318d7448 |
15 | ce63950e44ba |
hex | 65f6abe128e8 |
112110120020200 has 48 divisors (see below), whose sum is σ = 265574067355980. Its totient is φ = 43997933890560.
The previous prime is 112110120020177. The next prime is 112110120020209. The reversal of 112110120020200 is 2020021011211.
It can be written as a sum of positive squares in 6 ways, for example, as 59585400228964 + 52524719791236 = 7719158^2 + 7247394^2 .
It is not an unprimeable number, because it can be changed into a prime (112110120020209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5288202609 + ... + 5288223808.
Almost surely, 2112110120020200 is an apocalyptic number.
112110120020200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112110120020200 is an abundant number, since it is smaller than the sum of its proper divisors (153463947335780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110120020200 is a wasteful number, since it uses less digits than its factorization.
112110120020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10576426486 (or 10576426477 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112110120020200 its reverse (2020021011211), we get a palindrome (114130141031411).
The spelling of 112110120020200 in words is "one hundred twelve trillion, one hundred ten billion, one hundred twenty million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •