Search a number
-
+
1105067260000 = 255411411011213
BaseRepresentation
bin10000000101001011001…
…001000011100001100000
310220122101001000020200001
4100011023021003201200
5121101134204310000
62203354430305344
7142560411504214
oct20051311034140
93818331006601
101105067260000
11396724728480
1215a204958254
1380290856482
143b6b2476944
151db2a79146a
hex1014b243860

1105067260000 has 480 divisors, whose sum is σ = 3070725378336. Its totient is φ = 387840000000.

The previous prime is 1105067259997. The next prime is 1105067260019. The reversal of 1105067260000 is 627605011.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 911019394 + ... + 911020606.

Almost surely, 21105067260000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 28.

The spelling of 1105067260000 in words is "one trillion, one hundred five billion, sixty-seven million, two hundred sixty thousand".