Base | Representation |
---|---|
bin | 11001011101111111011010… |
… | …000101111011100100101000 |
3 | 112200121020211121120021020211 |
4 | 121131333122011323210220 |
5 | 104140201300420201300 |
6 | 1034121353051430504 |
7 | 32410415350624633 |
oct | 3135773205734450 |
9 | 480536747507224 |
10 | 112012111100200 |
11 | 327660846258a3 |
12 | 10690845455434 |
13 | 4a669099c93bc |
14 | 1d935b508cc1a |
15 | ce3a5aaa94ba |
hex | 65dfda17b928 |
112012111100200 has 48 divisors (see below), whose sum is σ = 261883064304000. Its totient is φ = 44554538032320.
The previous prime is 112012111100179. The next prime is 112012111100203. The reversal of 112012111100200 is 2001111210211.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (112012111100203) 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, 1564379160 + ... + 1564450759.
It is an arithmetic number, because the mean of its divisors is an integer number (5455897173000).
Almost surely, 2112012111100200 is an apocalyptic number.
112012111100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112012111100200 is an abundant number, since it is smaller than the sum of its proper divisors (149870953203800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112012111100200 is a wasteful number, since it uses less digits than its factorization.
112012111100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3128830114 (or 3128830105 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112012111100200 its reverse (2001111210211), we get a palindrome (114013222310411).
The spelling of 112012111100200 in words is "one hundred twelve trillion, twelve billion, one hundred eleven million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •