Search a number
-
+
1101011002000 = 24537132479901
BaseRepresentation
bin10000000001011001010…
…111101010001010010000
310220020220100102222202021
4100001121113222022100
5121014332304031000
62201444130501224
7142355036050150
oct20013127521220
93806810388667
101101011002000
11394a33009838
12159472434814
137ca95398100
143b40987a760
151d98e60711a
hex100595ea290

1101011002000 has 480 divisors, whose sum is σ = 3365050051584. Its totient is φ = 341003520000.

The previous prime is 1101011001977. The next prime is 1101011002019. The reversal of 1101011002000 is 2001101011.

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

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 111197050 + ... + 111206950.

Almost surely, 21101011002000 is an apocalyptic number.

1101011002000 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 1101011002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1682525025792).

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

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

1101011002000 is a wasteful number, since it uses less digits than its factorization.

1101011002000 is an odious number, because the sum of its binary digits is odd.

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

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 1101011002000 its reverse (2001101011), we get a palindrome (1103012103011).

The spelling of 1101011002000 in words is "one trillion, one hundred one billion, eleven million, two thousand".