Base | Representation |
---|---|
bin | 10011010110011000… |
… | …01001001100100000 |
3 | 222210222101022021200 |
4 | 21223030021030200 |
5 | 132233344430341 |
6 | 4434452521200 |
7 | 515300631615 |
oct | 115314111440 |
9 | 28728338250 |
10 | 10388280096 |
11 | 4450a05657 |
12 | 201b020200 |
13 | c972873cc |
14 | 70795650c |
15 | 40c008db6 |
hex | 26b309320 |
10388280096 has 288 divisors, whose sum is σ = 33022080000. Its totient is φ = 3082489344.
The previous prime is 10388280061. The next prime is 10388280101. The reversal of 10388280096 is 69008288301.
It is a tau number, because it is divible by the number of its divisors (288).
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 47 ways as a sum of consecutive naturals, for example, 7424805 + ... + 7426203.
It is an arithmetic number, because the mean of its divisors is an integer number (114660000).
Almost surely, 210388280096 is an apocalyptic number.
10388280096 is a gapful number since it is divisible by the number (16) 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 10388280096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16511040000).
10388280096 is an abundant number, since it is smaller than the sum of its proper divisors (22633799904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10388280096 is a wasteful number, since it uses less digits than its factorization.
10388280096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1516 (or 1505 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 45.
The spelling of 10388280096 in words is "ten billion, three hundred eighty-eight million, two hundred eighty thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •