Base | Representation |
---|---|
bin | 1100110101011… |
… | …01011010010000 |
3 | 21111120221200002 |
4 | 12122231122100 |
5 | 210030240130 |
6 | 14403345132 |
7 | 2445065150 |
oct | 632553220 |
9 | 244527602 |
10 | 107665040 |
11 | 5585737a |
12 | 300821a8 |
13 | 193c8632 |
14 | 10428760 |
15 | 96bab45 |
hex | 66ad690 |
107665040 has 40 divisors (see below), whose sum is σ = 286082880. Its totient is φ = 36913536.
The previous prime is 107665013. The next prime is 107665043. The reversal of 107665040 is 40566701.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 107664994 and 107665012.
It is not an unprimeable number, because it can be changed into a prime (107665043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95570 + ... + 96689.
It is an arithmetic number, because the mean of its divisors is an integer number (7152072).
Almost surely, 2107665040 is an apocalyptic number.
107665040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107665040 is an abundant number, since it is smaller than the sum of its proper divisors (178417840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107665040 is a wasteful number, since it uses less digits than its factorization.
107665040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192279 (or 192273 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 107665040 is about 10376.1765597931. The cubic root of 107665040 is about 475.7274762314.
The spelling of 107665040 in words is "one hundred seven million, six hundred sixty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •