1065996000 has 144 divisors (see below), whose sum is σ = 3783347568. Its totient is φ = 284256000.

The previous prime is 1065995989. The next prime is 1065996017. The reversal of 1065996000 is 6995601.

1065996000 is a `hidden beast` number, since 1 + 0 + 6 + 599 + 60 + 0 + 0 = 666.

It is a tau number, because it is divible by the number of its divisors (144).

It is a super-2 number, since 2×1065996000² = 2272694944032000000, which contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21195 + ... + 50805.

It is an arithmetic number, because the mean of its divisors is an integer number (26273247).

Almost surely, 2^1065996000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 36.

The square root of 1065996000 is about 32649.5941781824. The cubic root of 1065996000 is about 1021.5317240484.

The spelling of 1065996000 in words is "one billion, sixty-five million, nine hundred ninety-six thousand".