Base | Representation |
---|---|
bin | 10011111110111000… |
… | …00001101001000000 |
3 | 1000200122121020121121 |
4 | 21333130001221000 |
5 | 133432331102101 |
6 | 4532310002024 |
7 | 526564251202 |
oct | 117734015100 |
9 | 30618536547 |
10 | 10727987776 |
11 | 4605740000 |
12 | 20b4946314 |
13 | 101c77897c |
14 | 73ab04772 |
15 | 42bc5d0a1 |
hex | 27f701a40 |
10727987776 has 105 divisors (see below), whose sum is σ = 23637936595. Its totient is φ = 4830784640.
The previous prime is 10727987771. The next prime is 10727987783. The reversal of 10727987776 is 67778972701.
The square root of 10727987776 is 103576.
It is a perfect power (a square), and thus also a powerful number.
It is a super-3 number, since 3×107279877763 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10727987771) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 100261515 + ... + 100261621.
Almost surely, 210727987776 is an apocalyptic number.
10727987776 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
10727987776 is the 103576-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10727987776
10727987776 is an abundant number, since it is smaller than the sum of its proper divisors (12909948819).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10727987776 is an frugal number, since it uses more digits than its factorization.
10727987776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270 (or 120 counting only the distinct ones).
The product of its (nonzero) digits is 14521248, while the sum is 61.
The spelling of 10727987776 in words is "ten billion, seven hundred twenty-seven million, nine hundred eighty-seven thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •