Base | Representation |
---|---|
bin | 10100010100110100… |
… | …11101000011000000 |
3 | 1001011111002101120020 |
4 | 22022122131003000 |
5 | 134322001000440 |
6 | 5002444413440 |
7 | 534261350601 |
oct | 121232350300 |
9 | 31144071506 |
10 | 10912125120 |
11 | 469a679126 |
12 | 2146547280 |
13 | 104b96aa90 |
14 | 757357da8 |
15 | 43ced23d0 |
hex | 28a69d0c0 |
10912125120 has 224 divisors, whose sum is σ = 37391083968. Its totient is φ = 2680307712.
The previous prime is 10912125101. The next prime is 10912125157. The reversal of 10912125120 is 2152121901.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 31 ways as a sum of consecutive naturals, for example, 10944462 + ... + 10945458.
It is an arithmetic number, because the mean of its divisors is an integer number (166924482).
Almost surely, 210912125120 is an apocalyptic number.
10912125120 is a gapful number since it is divisible by the number (10) 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 10912125120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18695541984).
10912125120 is an abundant number, since it is smaller than the sum of its proper divisors (26478958848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10912125120 is a wasteful number, since it uses less digits than its factorization.
10912125120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1907 (or 1897 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 24.
The spelling of 10912125120 in words is "ten billion, nine hundred twelve million, one hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •