Search a number
-
+
10036982592 = 2633713293171
BaseRepresentation
bin10010101100100000…
…00011001101000000
3221220111100112201000
421112100003031000
5131023431420332
64335543212000
7503503641630
oct112620031500
927814315630
1010036982592
11429068463a
121b41447000
13c3c568770
146b302c6c0
153db265b7c
hex256403340

10036982592 has 896 divisors, whose sum is σ = 39326515200. Its totient is φ = 2438553600.

The previous prime is 10036982567. The next prime is 10036982609. The reversal of 10036982592 is 29528963001.

It is a super-2 number, since 2×100369825922 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 141365917 + ... + 141365987.

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

Almost surely, 210036982592 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 233280, while the sum is 45.

The spelling of 10036982592 in words is "ten billion, thirty-six million, nine hundred eighty-two thousand, five hundred ninety-two".