Base | Representation |
---|---|
bin | 110010001100010101… |
… | …1111110111011110000 |
3 | 101022012221211022021010 |
4 | 1210120223332323300 |
5 | 3231222310144202 |
6 | 121303422430520 |
7 | 10534044663420 |
oct | 1443053767360 |
9 | 338187738233 |
10 | 107788365552 |
11 | 417927a444a |
12 | 18a82132440 |
13 | a21a253a7a |
14 | 5307598480 |
15 | 2c0cd7d76c |
hex | 1918afeef0 |
107788365552 has 80 divisors (see below), whose sum is σ = 318596052992. Its totient is φ = 30761475840.
The previous prime is 107788365541. The next prime is 107788365557. The reversal of 107788365552 is 255563887701.
It is a junction number, because it is equal to n+sod(n) for n = 107788365492 and 107788365501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107788365557) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111777 + ... + 477567.
Almost surely, 2107788365552 is an apocalyptic number.
107788365552 is a gapful number since it is divisible by the number (12) 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 107788365552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159298026496).
107788365552 is an abundant number, since it is smaller than the sum of its proper divisors (210807687440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107788365552 is a wasteful number, since it uses less digits than its factorization.
107788365552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366686 (or 366680 counting only the distinct ones).
The product of its (nonzero) digits is 14112000, while the sum is 57.
The spelling of 107788365552 in words is "one hundred seven billion, seven hundred eighty-eight million, three hundred sixty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •