Base | Representation |
---|---|
bin | 10101101111111111… |
… | …10011101010000000 |
3 | 1010010210010120012012 |
4 | 22313333303222000 |
5 | 142403241014101 |
6 | 5210404152052 |
7 | 562235641154 |
oct | 126777635200 |
9 | 33123116165 |
10 | 11676891776 |
11 | 4a52334690 |
12 | 231a698628 |
13 | 1141235924 |
14 | 7cab51064 |
15 | 4851e9bbb |
hex | 2b7ff3a80 |
11676891776 has 64 divisors (see below), whose sum is σ = 25401720960. Its totient is φ = 5302579200.
The previous prime is 11676891773. The next prime is 11676891797. The reversal of 11676891776 is 67719867611.
It is a tau number, because it is divible by the number of its divisors (64).
It is not an unprimeable number, because it can be changed into a prime (11676891773) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1729880 + ... + 1736616.
It is an arithmetic number, because the mean of its divisors is an integer number (396901890).
Almost surely, 211676891776 is an apocalyptic number.
11676891776 is a gapful number since it is divisible by the number (16) 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 11676891776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12700860480).
11676891776 is an abundant number, since it is smaller than the sum of its proper divisors (13724829184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11676891776 is a wasteful number, since it uses less digits than its factorization.
11676891776 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7993 (or 7981 counting only the distinct ones).
The product of its digits is 5334336, while the sum is 59.
The spelling of 11676891776 in words is "eleven billion, six hundred seventy-six million, eight hundred ninety-one thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •