Base | Representation |
---|---|
bin | 10011010101100000… |
… | …00111000010000000 |
3 | 222210110112221111100 |
4 | 21222300013002000 |
5 | 132230004244300 |
6 | 4434031214400 |
7 | 515151313353 |
oct | 115260070200 |
9 | 28713487440 |
10 | 10380931200 |
11 | 4447846292 |
12 | 2018677400 |
13 | c958b3453 |
14 | 7069a229a |
15 | 40b556700 |
hex | 26ac07080 |
10380931200 has 576 divisors, whose sum is σ = 39757723200. Its totient is φ = 2571264000.
The previous prime is 10380931193. The next prime is 10380931213. The reversal of 10380931200 is 213908301.
It is a tau number, because it is divible by the number of its divisors (576).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 33379045 + ... + 33379355.
It is an arithmetic number, because the mean of its divisors is an integer number (69023825).
Almost surely, 210380931200 is an apocalyptic number.
10380931200 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 10380931200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19878861600).
10380931200 is an abundant number, since it is smaller than the sum of its proper divisors (29376792000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10380931200 is a wasteful number, since it uses less digits than its factorization.
10380931200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421 (or 401 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The spelling of 10380931200 in words is "ten billion, three hundred eighty million, nine hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •