Base | Representation |
---|---|
bin | 110001110101011001… |
… | …0101100000000110000 |
3 | 101020020021221112110211 |
4 | 1203222302230000300 |
5 | 3223133200333440 |
6 | 121055155033504 |
7 | 10506005100613 |
oct | 1435262540060 |
9 | 336207845424 |
10 | 107018371120 |
11 | 41428098211 |
12 | 188a829b894 |
13 | a12687856b |
14 | 527320017a |
15 | 2bb5481eea |
hex | 18eacac030 |
107018371120 has 40 divisors (see below), whose sum is σ = 256844096640. Its totient is φ = 41426465280.
The previous prime is 107018371099. The next prime is 107018371127. The reversal of 107018371120 is 21173810701.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1070183711202 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (107018371127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21573805 + ... + 21578764.
It is an arithmetic number, because the mean of its divisors is an integer number (6421102416).
Almost surely, 2107018371120 is an apocalyptic number.
107018371120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107018371120 is an abundant number, since it is smaller than the sum of its proper divisors (149825725520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107018371120 is a wasteful number, since it uses less digits than its factorization.
107018371120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43152613 (or 43152607 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 31.
The spelling of 107018371120 in words is "one hundred seven billion, eighteen million, three hundred seventy-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •