Base | Representation |
---|---|
bin | 110001111000001111… |
… | …0111010000000011100 |
3 | 101020110221121022022102 |
4 | 1203300132322000130 |
5 | 3223332121130420 |
6 | 121112445304232 |
7 | 10511244456434 |
oct | 1436036720034 |
9 | 336427538272 |
10 | 107113848860 |
11 | 41476a80037 |
12 | 18914265078 |
13 | a140597875 |
14 | 5281b752c4 |
15 | 2bbda41a75 |
hex | 18f07ba01c |
107113848860 has 12 divisors (see below), whose sum is σ = 224939082648. Its totient is φ = 42845539536.
The previous prime is 107113848839. The next prime is 107113848869. The reversal of 107113848860 is 68848311701.
It is a super-2 number, since 2×1071138488602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107113848869) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2677846202 + ... + 2677846241.
It is an arithmetic number, because the mean of its divisors is an integer number (18744923554).
Almost surely, 2107113848860 is an apocalyptic number.
107113848860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107113848860 is an abundant number, since it is smaller than the sum of its proper divisors (117825233788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107113848860 is a wasteful number, since it uses less digits than its factorization.
107113848860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5355692452 (or 5355692450 counting only the distinct ones).
The product of its (nonzero) digits is 258048, while the sum is 47.
The spelling of 107113848860 in words is "one hundred seven billion, one hundred thirteen million, eight hundred forty-eight thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •