Search a number
-
+
10251112872 = 23371113538397
BaseRepresentation
bin10011000110000001…
…11001000110101000
3222110102021111020010
421203000321012220
5131443241102442
64413112531520
7512014010310
oct114300710650
928412244203
1010251112872
114390538910
121ba10b0ba0
13c74a2c580
146d364c440
153eee61b9c
hex2630391a8

10251112872 has 512 divisors, whose sum is σ = 35846737920. Its totient is φ = 2357821440.

The previous prime is 10251112853. The next prime is 10251112913. The reversal of 10251112872 is 27821115201.

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

It is an unprimeable number.

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 127 ways as a sum of consecutive naturals, for example, 105681528 + ... + 105681624.

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

Almost surely, 210251112872 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2240, while the sum is 30.

The spelling of 10251112872 in words is "ten billion, two hundred fifty-one million, one hundred twelve thousand, eight hundred seventy-two".