Base | Representation |
---|---|
bin | 11001011111100101110000… |
… | …000010101000101010001100 |
3 | 112200222202111000210122001110 |
4 | 121133211300002220222030 |
5 | 104144001324224013400 |
6 | 1034244045225412020 |
7 | 32421355464441516 |
oct | 3137456002505214 |
9 | 480882430718043 |
10 | 112122001001100 |
11 | 327a8745606912 |
12 | 106a9bb333a010 |
13 | 4a740a0457abc |
14 | 1d98a3b7b2bb6 |
15 | ce683d1a4e50 |
hex | 65f9700a8a8c |
112122001001100 has 72 divisors (see below), whose sum is σ = 324496866426880. Its totient is φ = 29890855241280.
The previous prime is 112122001001099. The next prime is 112122001001111. The reversal of 112122001001100 is 1100100221211.
112122001001100 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 51079720 + ... + 53229519.
Almost surely, 2112122001001100 is an apocalyptic number.
112122001001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112122001001100 is an abundant number, since it is smaller than the sum of its proper divisors (212374865425780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112122001001100 is a wasteful number, since it uses less digits than its factorization.
112122001001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104312839 (or 104312832 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112122001001100 its reverse (1100100221211), we get a palindrome (113222101222311).
The spelling of 112122001001100 in words is "one hundred twelve trillion, one hundred twenty-two billion, one million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •