Base | Representation |
---|---|
bin | 11001011111010100010110… |
… | …001010000001111110110000 |
3 | 112200220222020122020222012110 |
4 | 121133110112022001332300 |
5 | 104143200041124334300 |
6 | 1034231315011325320 |
7 | 32420124414204612 |
oct | 3137242612017660 |
9 | 480828218228173 |
10 | 112103313121200 |
11 | 327a0825803075 |
12 | 106a64588b0840 |
13 | 4a723b286c9bb |
14 | 1d97b87884db2 |
15 | ce60e7720550 |
hex | 65f516281fb0 |
112103313121200 has 120 divisors (see below), whose sum is σ = 378004505022400. Its totient is φ = 28320836993280.
The previous prime is 112103313121169. The next prime is 112103313121229. The reversal of 112103313121200 is 2121313301211.
It is a tau number, because it is divible by the number of its divisors (120).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2458383190 + ... + 2458428789.
Almost surely, 2112103313121200 is an apocalyptic number.
112103313121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112103313121200 is an abundant number, since it is smaller than the sum of its proper divisors (265901191901200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112103313121200 is a wasteful number, since it uses less digits than its factorization.
112103313121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4916812019 (or 4916812008 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 112103313121200 its reverse (2121313301211), we get a palindrome (114224626422411).
The spelling of 112103313121200 in words is "one hundred twelve trillion, one hundred three billion, three hundred thirteen million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •