Search a number
-
+
10125715392 = 263413347433
BaseRepresentation
bin10010110111000101…
…00010011111000000
3222010200022122020000
421123202202133000
5131214140343032
64352433120000
7505632106062
oct113342423700
928120278200
1010125715392
11432677a931
121b670b9000
13c54a65990
146c0b29732
153e3e41e7c
hex25b8a27c0

10125715392 has 280 divisors, whose sum is σ = 32492722416. Its totient is φ = 3099451392.

The previous prime is 10125715361. The next prime is 10125715433. The reversal of 10125715392 is 29351752101.

10125715392 is a `hidden beast` number, since 1 + 0 + 1 + 257 + 15 + 392 = 666.

It is a super-2 number, since 2×101257153922 (a number of 21 digits) 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 polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 23384808 + ... + 23385240.

Almost surely, 210125715392 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10125715392 in words is "ten billion, one hundred twenty-five million, seven hundred fifteen thousand, three hundred ninety-two".