Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …000111011111011001000 |
3 | 10220021011101111020020100 |
4 | 100001133120323323020 |
5 | 121020034133001300 |
6 | 2201502135325400 |
7 | 142360403400432 |
oct | 20013730737310 |
9 | 3807141436210 |
10 | 1101112000200 |
11 | 394a85022223 |
12 | 1594a0220860 |
13 | 7cab029b064 |
14 | 3b41904b652 |
15 | 1d998407700 |
hex | 1005f63bec8 |
1101112000200 has 72 divisors (see below), whose sum is σ = 3697901140050. Its totient is φ = 293629866240.
The previous prime is 1101112000141. The next prime is 1101112000213. The reversal of 1101112000200 is 20002111011.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 1037598927876 + 63513072324 = 1018626^2 + 252018^2 .
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 305862645 + ... + 305866244.
Almost surely, 21101112000200 is an apocalyptic number.
1101112000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101112000200 is an abundant number, since it is smaller than the sum of its proper divisors (2596789139850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101112000200 is a wasteful number, since it uses less digits than its factorization.
1101112000200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 611728911 (or 611728899 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1101112000200 its reverse (20002111011), we get a palindrome (1121114111211).
The spelling of 1101112000200 in words is "one trillion, one hundred one billion, one hundred twelve million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •