Base | Representation |
---|---|
bin | 10011110110110011… |
… | …11101010000101000 |
3 | 1000111221022012202110 |
4 | 21323121331100220 |
5 | 133313021233210 |
6 | 4521452002320 |
7 | 525113236530 |
oct | 117331752050 |
9 | 30457265673 |
10 | 10660336680 |
11 | 4580533804 |
12 | 20961603a0 |
13 | 100b750336 |
14 | 731b344c0 |
15 | 425d48420 |
hex | 27b67d428 |
10660336680 has 128 divisors (see below), whose sum is σ = 36625582080. Its totient is φ = 2431591680.
The previous prime is 10660336649. The next prime is 10660336681. The reversal of 10660336680 is 8663306601.
It is a super-2 number, since 2×106603366802 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10660336681) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 399517 + ... + 425363.
It is an arithmetic number, because the mean of its divisors is an integer number (286137360).
Almost surely, 210660336680 is an apocalyptic number.
10660336680 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 10660336680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18312791040).
10660336680 is an abundant number, since it is smaller than the sum of its proper divisors (25965245400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10660336680 is a wasteful number, since it uses less digits than its factorization.
10660336680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26359 (or 26355 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 39.
The spelling of 10660336680 in words is "ten billion, six hundred sixty million, three hundred thirty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •