Search a number
-
+
1104052000000 = 28561973199
BaseRepresentation
bin10000000100001110101…
…000001001010100000000
310220112202021121200202211
4100010032220021110000
5121042044303000000
62203110001551504
7142523303105425
oct20041650112400
93815667550684
101104052000000
11396253631624
12159b80945594
138015b405501
143b6176b5d4c
151dabb5987ba
hex1010ea09500

1104052000000 has 504 divisors, whose sum is σ = 2954180936000. Its totient is φ = 410572800000.

The previous prime is 1104051999989. The next prime is 1104052000027. The reversal of 1104052000000 is 2504011.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

Almost surely, 21104052000000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 40, while the sum is 13.

Adding to 1104052000000 its reverse (2504011), we get a palindrome (1104054504011).

The spelling of 1104052000000 in words is "one trillion, one hundred four billion, fifty-two million", and thus it is an aban number.