Base | Representation |
---|---|
bin | 10000001011111100001… |
… | …010001110001000010000 |
3 | 10221100010100002100210100 |
4 | 100023330022032020100 |
5 | 121211024004200422 |
6 | 2210555345132400 |
7 | 143235424564122 |
oct | 20137412161020 |
9 | 3840110070710 |
10 | 1112332100112 |
11 | 399812521372 |
12 | 15b6b192a100 |
13 | 80b7a99972c |
14 | 3bba1253212 |
15 | 1de034717ac |
hex | 102fc28e210 |
1112332100112 has 30 divisors (see below), whose sum is σ = 3112984975022. Its totient is φ = 370777366656.
The previous prime is 1112332100053. The next prime is 1112332100123. The reversal of 1112332100112 is 2110012332111.
1112332100112 is a `hidden beast` number, since 111 + 233 + 210 + 0 + 112 = 666.
It can be written as a sum of positive squares in only one way, i.e., 610592211216 + 501739888896 = 781404^2 + 708336^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3862264093 + ... + 3862264380.
Almost surely, 21112332100112 is an apocalyptic number.
1112332100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112332100112 is an abundant number, since it is smaller than the sum of its proper divisors (2000652874910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112332100112 is a wasteful number, since it uses less digits than its factorization.
1112332100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7724528487 (or 7724528478 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1112332100112 its reverse (2110012332111), we get a palindrome (3222344432223).
The spelling of 1112332100112 in words is "one trillion, one hundred twelve billion, three hundred thirty-two million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •