Base | Representation |
---|---|
bin | 110001101001000111… |
… | …1100110110011101100 |
3 | 101012011120222102010011 |
4 | 1203102033212303230 |
5 | 3221312232142310 |
6 | 120550243423004 |
7 | 10462544324236 |
oct | 1432217466354 |
9 | 335146872104 |
10 | 106606521580 |
11 | 41236669599 |
12 | 187b2384a64 |
13 | a08c448600 |
14 | 5234633256 |
15 | 2b8e22c78a |
hex | 18d23e6cec |
106606521580 has 108 divisors (see below), whose sum is σ = 249159214080. Its totient is φ = 38296896768.
The previous prime is 106606521577. The next prime is 106606521599. The reversal of 106606521580 is 85125606601.
It is a super-2 number, since 2×1066065215802 (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 35 ways as a sum of consecutive naturals, for example, 4615701 + ... + 4638739.
It is an arithmetic number, because the mean of its divisors is an integer number (2307029760).
Almost surely, 2106606521580 is an apocalyptic number.
106606521580 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 106606521580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124579607040).
106606521580 is an abundant number, since it is smaller than the sum of its proper divisors (142552692500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106606521580 is a wasteful number, since it uses less digits than its factorization.
106606521580 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23148 (or 23096 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 40.
The spelling of 106606521580 in words is "one hundred six billion, six hundred six million, five hundred twenty-one thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •