Base | Representation |
---|---|
bin | 110010001111100011… |
… | …1000110101001101110 |
3 | 101022111110121201202020 |
4 | 1210133013012221232 |
5 | 3231432402411400 |
6 | 121322232411010 |
7 | 10536524021010 |
oct | 1443707065156 |
9 | 338443551666 |
10 | 107896138350 |
11 | 41838614780 |
12 | 18ab2246a66 |
13 | a236689460 |
14 | 5317a101b0 |
15 | 2c1756b2a0 |
hex | 191f1c6a6e |
107896138350 has 768 divisors, whose sum is σ = 379175731200. Its totient is φ = 19570636800.
The previous prime is 107896138303. The next prime is 107896138367. The reversal of 107896138350 is 53831698701.
It is a junction number, because it is equal to n+sod(n) for n = 107896138293 and 107896138302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 542191551 + ... + 542191749.
It is an arithmetic number, because the mean of its divisors is an integer number (493718400).
Almost surely, 2107896138350 is an apocalyptic number.
107896138350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 107896138350, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189587865600).
107896138350 is an abundant number, since it is smaller than the sum of its proper divisors (271279592850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107896138350 is a wasteful number, since it uses less digits than its factorization.
107896138350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 425 (or 420 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 51.
The spelling of 107896138350 in words is "one hundred seven billion, eight hundred ninety-six million, one hundred thirty-eight thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •