Base | Representation |
---|---|
bin | 10100011010001001… |
… | …11000000000000000 |
3 | 1001021121011002222102 |
4 | 22031010320000000 |
5 | 134414420100000 |
6 | 5011122125532 |
7 | 535343156216 |
oct | 121504700000 |
9 | 31247132872 |
10 | 10956800000 |
11 | 4712912013 |
12 | 21594b08a8 |
13 | 1057cb0413 |
14 | 75d266cb6 |
15 | 441da93d5 |
hex | 28d138000 |
10956800000 has 192 divisors, whose sum is σ = 27645808680. Its totient is φ = 4341760000.
The previous prime is 10956799963. The next prime is 10956800021. The reversal of 10956800000 is 865901.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 102399947 + ... + 102400053.
Almost surely, 210956800000 is an apocalyptic number.
10956800000 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 10956800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13822904340).
10956800000 is an abundant number, since it is smaller than the sum of its proper divisors (16689008680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10956800000 is an frugal number, since it uses more digits than its factorization.
10956800000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162 (or 114 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 29.
The spelling of 10956800000 in words is "ten billion, nine hundred fifty-six million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •