Base | Representation |
---|---|
bin | 11001011111011101101001… |
… | …011011110011010011100000 |
3 | 112200221221000122202022121010 |
4 | 121133131221123303103200 |
5 | 104143331014324120300 |
6 | 1034240050013500520 |
7 | 32420630044160223 |
oct | 3137355133632340 |
9 | 480857018668533 |
10 | 112113300223200 |
11 | 327a4a90208681 |
12 | 106a83854a1740 |
13 | 4a73314992503 |
14 | 1d9845400b5ba |
15 | ce64ce3d1a50 |
hex | 65f7696f34e0 |
112113300223200 has 144 divisors (see below), whose sum is σ = 364934849924736. Its totient is φ = 29896383782400.
The previous prime is 112113300223189. The next prime is 112113300223201. The reversal of 112113300223200 is 2322003311211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112113300223201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 157639599 + ... + 158349201.
It is an arithmetic number, because the mean of its divisors is an integer number (2534269791144).
Almost surely, 2112113300223200 is an apocalyptic number.
112113300223200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112113300223200 is an abundant number, since it is smaller than the sum of its proper divisors (252821549701536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112113300223200 is a wasteful number, since it uses less digits than its factorization.
112113300223200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775457 (or 775444 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 112113300223200 its reverse (2322003311211), we get a palindrome (114435303534411).
The spelling of 112113300223200 in words is "one hundred twelve trillion, one hundred thirteen billion, three hundred million, two hundred twenty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •