Search a number
-
+
1104031011072 = 283112199227263
BaseRepresentation
bin10000000100001101011…
…000000101000100000000
310220112200211010100101010
4100010031120011010000
5121042023414323242
62203103532040520
7142522626520263
oct20041530050400
93815624110333
101104031011072
113962427a6300
12159b75903140
1380156c66c22
143b6149b0cda
151dab97ee89c
hex1010d605100

1104031011072 has 432 divisors, whose sum is σ = 3272663116800. Its totient is φ = 330147164160.

The previous prime is 1104031011071. The next prime is 1104031011077. The reversal of 1104031011072 is 2701101304011.

It is not an unprimeable number, because it can be changed into a prime (1104031011071) by changing a digit.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4197836413 + ... + 4197836675.

Almost surely, 21104031011072 is an apocalyptic number.

1104031011072 is a gapful number since it is divisible by the number (12) 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 1104031011072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1636331558400).

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

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

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

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

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

The product of its (nonzero) digits is 168, while the sum is 21.

Adding to 1104031011072 its reverse (2701101304011), we get a palindrome (3805132315083).

The spelling of 1104031011072 in words is "one trillion, one hundred four billion, thirty-one million, eleven thousand, seventy-two".