Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …011111101111100100000 |
3 | 10220021010120022022212100 |
4 | 100001132223331330200 |
5 | 121020023123241000 |
6 | 2201501034530400 |
7 | 142360201242465 |
oct | 20013653757440 |
9 | 3807116268770 |
10 | 1101100212000 |
11 | 394a79400608 |
12 | 159498296a00 |
13 | 7caaaa015a9 |
14 | 3b41765d66c |
15 | 1d997379a00 |
hex | 1005eafdf20 |
1101100212000 has 144 divisors (see below), whose sum is σ = 3907804780152. Its totient is φ = 293626713600.
The previous prime is 1101100211977. The next prime is 1101100212031. The reversal of 1101100212000 is 2120011011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 132300967824 + 968799244176 = 363732^2 + 984276^2 .
It is a tau number, because it is divible by the number of its divisors (144).
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 23 ways as a sum of consecutive naturals, for example, 15257059 + ... + 15329058.
Almost surely, 21101100212000 is an apocalyptic number.
1101100212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101100212000 is an abundant number, since it is smaller than the sum of its proper divisors (2806704568152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101100212000 is a wasteful number, since it uses less digits than its factorization.
1101100212000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30586148 (or 30586127 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1101100212000 its reverse (2120011011), we get a palindrome (1103220223011).
The spelling of 1101100212000 in words is "one trillion, one hundred one billion, one hundred million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •