Base | Representation |
---|---|
bin | 110010001011101011… |
… | …1110111100101000000 |
3 | 101022011102100001001011 |
4 | 1210113113313211000 |
5 | 3231201134042303 |
6 | 121301314050304 |
7 | 10533356365150 |
oct | 1442727674500 |
9 | 338142301034 |
10 | 107766315328 |
11 | 41781303821 |
12 | 18a76879994 |
13 | a2158033b9 |
14 | 5304698760 |
15 | 2c0ae7516d |
hex | 19175f7940 |
107766315328 has 112 divisors (see below), whose sum is σ = 248597155840. Its totient is φ = 45398900736.
The previous prime is 107766315313. The next prime is 107766315367. The reversal of 107766315328 is 823513667701.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×1077663153282 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6192976 + ... + 6210352.
Almost surely, 2107766315328 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 107766315328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124298577920).
107766315328 is an abundant number, since it is smaller than the sum of its proper divisors (140830840512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107766315328 is a wasteful number, since it uses less digits than its factorization.
107766315328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17632 (or 17622 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 49.
The spelling of 107766315328 in words is "one hundred seven billion, seven hundred sixty-six million, three hundred fifteen thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •