Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …101011111100001000000 |
3 | 10220021010121001122002010 |
4 | 100001132231133201000 |
5 | 121020023224033043 |
6 | 2201501051252520 |
7 | 142360204525602 |
oct | 20013655374100 |
9 | 3807117048063 |
10 | 1101100611648 |
11 | 394a796538a4 |
12 | 15949844a140 |
13 | 7caaab1147b |
14 | 3b417725172 |
15 | 1d997408133 |
hex | 1005eb5f840 |
1101100611648 has 112 divisors (see below), whose sum is σ = 2931649793280. Its totient is φ = 364732416000.
The previous prime is 1101100611647. The next prime is 1101100611671. The reversal of 1101100611648 is 8461160011011.
It is not an unprimeable number, because it can be changed into a prime (1101100611647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20213248 + ... + 20267648.
Almost surely, 21101100611648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101100611648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1465824896640).
1101100611648 is an abundant number, since it is smaller than the sum of its proper divisors (1830549181632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101100611648 is a wasteful number, since it uses less digits than its factorization.
1101100611648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55076 (or 55066 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 30.
Adding to 1101100611648 its reverse (8461160011011), we get a palindrome (9562260622659).
The spelling of 1101100611648 in words is "one trillion, one hundred one billion, one hundred million, six hundred eleven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •