Search a number
-
+
1101001000000 = 265611101991
BaseRepresentation
bin10000000001011000110…
…001100000010001000000
310220020212122121211120211
4100001120301200101000
5121014322224000000
62201443132243504
7142354555041616
oct20013061402100
93806778554524
101101001000000
11394a283a8120
1215946b010594
137ca932a5675
143b4083d56b6
151d98d7cd7ba
hex10058c60440

1101001000000 has 392 divisors, whose sum is σ = 3011766448896. Its totient is φ = 396000000000.

The previous prime is 1101000999997. The next prime is 1101001000013. The reversal of 1101001000000 is 1001011.

It is a Harshad number since it is a multiple of its sum of digits (4).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1110999505 + ... + 1111000495.

Almost surely, 21101001000000 is an apocalyptic number.

1101001000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1101001000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1505883224448).

1101001000000 is an abundant number, since it is smaller than the sum of its proper divisors (1910765448896).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

1101001000000 is an frugal number, since it uses more digits than its factorization.

1101001000000 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1145 (or 1110 counting only the distinct ones).

The product of its (nonzero) digits is 1, while the sum is 4.

Adding to 1101001000000 its reverse (1001011), we get a palindrome (1101002001011).

The spelling of 1101001000000 in words is "one trillion, one hundred one billion, one million", and thus it is an aban number.