Search a number
-
+
1040283972 = 223571319619
BaseRepresentation
bin111110000000010…
…111100101000100
32200111110220100000
4332000113211010
54112303041342
6251120521300
734531160610
oct7600274504
92614426300
101040283972
11494238822
12250480230
131376a3060
149c236340
15614dc44c
hex3e017944

1040283972 has 288 divisors, whose sum is σ = 3538662400. Its totient is φ = 259500672.

The previous prime is 1040283949. The next prime is 1040283973. The reversal of 1040283972 is 2793820401.

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

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

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 95 ways as a sum of consecutive naturals, for example, 1680279 + ... + 1680897.

Almost surely, 21040283972 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 1040283972 is about 32253.4334916455. The cubic root of 1040283972 is about 1013.2516098201.

The spelling of 1040283972 in words is "one billion, forty million, two hundred eighty-three thousand, nine hundred seventy-two".