Base | Representation |
---|---|
bin | 10100000101000000… |
… | …00000000000000000 |
3 | 1000211020021021210222 |
4 | 22002200000000000 |
5 | 134034004030110 |
6 | 4541343042212 |
7 | 531060026162 |
oct | 120240000000 |
9 | 30736237728 |
10 | 10779361280 |
11 | 4631739746 |
12 | 2109ba0368 |
13 | 102a2c52ac |
14 | 743878932 |
15 | 431509c55 |
hex | 282800000 |
10779361280 has 96 divisors (see below), whose sum is σ = 25971128820. Its totient is φ = 4294967296.
The previous prime is 10779361273. The next prime is 10779361339. The reversal of 10779361280 is 8216397701.
It can be written as a sum of positive squares in 2 ways, for example, as 10070523904 + 708837376 = 100352^2 + 26624^2 .
It is a zygodrome in base 4.
It is an unprimeable number.
In principle, a polygon with 10779361280 sides can be constructed with ruler and compass.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41942912 + ... + 41943168.
Almost surely, 210779361280 is an apocalyptic number.
10779361280 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 10779361280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12985564410).
10779361280 is an abundant number, since it is smaller than the sum of its proper divisors (15191767540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10779361280 is an frugal number, since it uses more digits than its factorization.
10779361280 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 44.
The spelling of 10779361280 in words is "ten billion, seven hundred seventy-nine million, three hundred sixty-one thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •