Base | Representation |
---|---|
bin | 110001111011011010… |
… | …0000100001000111000 |
3 | 101020202100110022210110 |
4 | 1203312310010020320 |
5 | 3224041313334210 |
6 | 121131201544320 |
7 | 10514004314160 |
oct | 1436664041070 |
9 | 336670408713 |
10 | 107220058680 |
11 | 41520a23049 |
12 | 189439450a0 |
13 | a1595a3a07 |
14 | 5291d015a0 |
15 | 2bc8021420 |
hex | 18f6d04238 |
107220058680 has 256 divisors, whose sum is σ = 374157480960. Its totient is φ = 24072192000.
The previous prime is 107220058637. The next prime is 107220058697. The reversal of 107220058680 is 86850022701.
It is a super-2 number, since 2×1072200586802 (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, 66969880 + ... + 66971480.
It is an arithmetic number, because the mean of its divisors is an integer number (1461552660).
Almost surely, 2107220058680 is an apocalyptic number.
107220058680 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 107220058680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187078740480).
107220058680 is an abundant number, since it is smaller than the sum of its proper divisors (266937422280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107220058680 is a wasteful number, since it uses less digits than its factorization.
107220058680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2990 (or 2986 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 39.
The spelling of 107220058680 in words is "one hundred seven billion, two hundred twenty million, fifty-eight thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •