Base | Representation |
---|---|
bin | 110001101000111111… |
… | …1111010111011010000 |
3 | 101012011022020111122120 |
4 | 1203101333322323100 |
5 | 3221310204102210 |
6 | 120550015334240 |
7 | 10462464350214 |
oct | 1432177727320 |
9 | 335138214576 |
10 | 106602409680 |
11 | 41234310228 |
12 | 187b0b21380 |
13 | a08b638b30 |
14 | 5233c82944 |
15 | 2b8dbb9270 |
hex | 18d1ffaed0 |
106602409680 has 320 divisors, whose sum is σ = 359887799040. Its totient is φ = 25947537408.
The previous prime is 106602409663. The next prime is 106602409691. The reversal of 106602409680 is 86904206601.
It is a super-2 number, since 2×1066024096802 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 138624336 + ... + 138625104.
It is an arithmetic number, because the mean of its divisors is an integer number (1124649372).
Almost surely, 2106602409680 is an apocalyptic number.
106602409680 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 106602409680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179943899520).
106602409680 is an abundant number, since it is smaller than the sum of its proper divisors (253285389360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106602409680 is a wasteful number, since it uses less digits than its factorization.
106602409680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1238 (or 1232 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 42.
The spelling of 106602409680 in words is "one hundred six billion, six hundred two million, four hundred nine thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •