Base | Representation |
---|---|
bin | 1100110101011… |
… | …01011010011010 |
3 | 21111120221200110 |
4 | 12122231122122 |
5 | 210030240200 |
6 | 14403345150 |
7 | 2445065163 |
oct | 632553232 |
9 | 244527613 |
10 | 107665050 |
11 | 55857389 |
12 | 300821b6 |
13 | 193c863c |
14 | 1042876a |
15 | 96bab50 |
hex | 66ad69a |
107665050 has 48 divisors (see below), whose sum is σ = 268464960. Its totient is φ = 28554240.
The previous prime is 107665043. The next prime is 107665111. The reversal of 107665050 is 50566701.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 107664999 and 107665017.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27091 + ... + 30809.
It is an arithmetic number, because the mean of its divisors is an integer number (5593020).
Almost surely, 2107665050 is an apocalyptic number.
107665050 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 107665050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134232480).
107665050 is an abundant number, since it is smaller than the sum of its proper divisors (160799910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107665050 is a wasteful number, since it uses less digits than its factorization.
107665050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3927 (or 3922 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 107665050 is about 10376.1770416662. The cubic root of 107665050 is about 475.7274909600.
The spelling of 107665050 in words is "one hundred seven million, six hundred sixty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •