Search a number
-
+
1069119000 = 23345367197
BaseRepresentation
bin111111101110010…
…111011000011000
32202111201212120000
4333232113120120
54142143302000
6254030533000
735331235005
oct7756273030
92674655500
101069119000
114a9542a24
1225a067160
1314065a9c1
14a1dc08ac
1563cd6000
hex3fb97618

1069119000 has 320 divisors, whose sum is σ = 3812196960. Its totient is φ = 279417600.

The previous prime is 1069118989. The next prime is 1069119031. The reversal of 1069119000 is 9119601.

It is a super-2 number, since 2×10691190002 = 2286030872322000000, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 21069119000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 486, while the sum is 27.

The square root of 1069119000 is about 32697.3852165582. The cubic root of 1069119000 is about 1022.5283297886.

The spelling of 1069119000 in words is "one billion, sixty-nine million, one hundred nineteen thousand".