Base | Representation |
---|---|
bin | 10100011100001010… |
… | …10001001001001000 |
3 | 1001022202220201021000 |
4 | 22032011101021020 |
5 | 134433230231300 |
6 | 5012524015000 |
7 | 535636512510 |
oct | 121605211110 |
9 | 31282821230 |
10 | 10973680200 |
11 | 47213a139a |
12 | 2163091460 |
13 | 105b6407c2 |
14 | 7615bc840 |
15 | 4435e0c00 |
hex | 28e151248 |
10973680200 has 384 divisors, whose sum is σ = 45741715200. Its totient is φ = 2360586240.
The previous prime is 10973680189. The next prime is 10973680253. The reversal of 10973680200 is 208637901.
10973680200 is a `hidden beast` number, since 1 + 0 + 97 + 368 + 0 + 200 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 634062 + ... + 651138.
It is an arithmetic number, because the mean of its divisors is an integer number (119119050).
Almost surely, 210973680200 is an apocalyptic number.
10973680200 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 10973680200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22870857600).
10973680200 is an abundant number, since it is smaller than the sum of its proper divisors (34768035000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10973680200 is a wasteful number, since it uses less digits than its factorization.
10973680200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17126 (or 17111 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 10973680200 in words is "ten billion, nine hundred seventy-three million, six hundred eighty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •