Base | Representation |
---|---|
bin | 10100011011010001… |
… | …00000111110100000 |
3 | 1001022020201210000000 |
4 | 22031220200332200 |
5 | 134424313033010 |
6 | 5012054300000 |
7 | 535515451020 |
oct | 121550407640 |
9 | 31266653000 |
10 | 10966142880 |
11 | 4718113500 |
12 | 2160657600 |
13 | 1059c01b54 |
14 | 7605b9a80 |
15 | 442b027c0 |
hex | 28da20fa0 |
10966142880 has 1152 divisors, whose sum is σ = 50129210880. Its totient is φ = 2217093120.
The previous prime is 10966142827. The next prime is 10966142899. The reversal of 10966142880 is 8824166901.
10966142880 is a `hidden beast` number, since 1 + 0 + 9 + 6 + 614 + 28 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 296382222 + ... + 296382258.
It is an arithmetic number, because the mean of its divisors is an integer number (43514940).
Almost surely, 210966142880 is an apocalyptic number.
10966142880 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 10966142880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25064605440).
10966142880 is an abundant number, since it is smaller than the sum of its proper divisors (39163068000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10966142880 is an equidigital number, since it uses as much as digits as its factorization.
10966142880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 45.
The spelling of 10966142880 in words is "ten billion, nine hundred sixty-six million, one hundred forty-two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •