Search a number
-
+
10489236912 = 243771117229
BaseRepresentation
bin10011100010011010…
…10000110110110000
31000002000100110000000
421301031100312300
5132440221040122
64452500430000
7520635020430
oct116115206660
930060313000
1010489236912
1144a299aa40
1220489a8300
13cb217457b
147171162c0
15415cec0ac
hex271350db0

10489236912 has 640 divisors, whose sum is σ = 40411699200. Its totient is φ = 2553016320.

The previous prime is 10489236899. The next prime is 10489236913. The reversal of 10489236912 is 21963298401.

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

It is a congruent number.

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

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

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

Almost surely, 210489236912 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10489236912 in words is "ten billion, four hundred eighty-nine million, two hundred thirty-six thousand, nine hundred twelve".