Base | Representation |
---|---|
bin | 10100100001010111… |
… | …01100101000001000 |
3 | 1001102211000021021122 |
4 | 22100223230220020 |
5 | 140030412334210 |
6 | 5021123054412 |
7 | 540006402320 |
oct | 122053545010 |
9 | 31384007248 |
10 | 11017308680 |
11 | 4743a90094 |
12 | 2175811408 |
13 | 10676a7a81 |
14 | 7672d8280 |
15 | 44735cb55 |
hex | 290aeca08 |
11017308680 has 32 divisors (see below), whose sum is σ = 28330223040. Its totient is φ = 3777362880.
The previous prime is 11017308671. The next prime is 11017308703. The reversal of 11017308680 is 8680371011.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 11017308680.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19673486 + ... + 19674045.
It is an arithmetic number, because the mean of its divisors is an integer number (885319470).
Almost surely, 211017308680 is an apocalyptic number.
11017308680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11017308680 is an abundant number, since it is smaller than the sum of its proper divisors (17312914360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11017308680 is a wasteful number, since it uses less digits than its factorization.
11017308680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39347549 (or 39347545 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 35.
Adding to 11017308680 its reverse (8680371011), we get a palindrome (19697679691).
The spelling of 11017308680 in words is "eleven billion, seventeen million, three hundred eight thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •