Base | Representation |
---|---|
bin | 1100110001010… |
… | …00000110111000 |
3 | 21110120012200120 |
4 | 12120220012320 |
5 | 204410302112 |
6 | 14343533240 |
7 | 2440332246 |
oct | 630500670 |
9 | 243505616 |
10 | 107119032 |
11 | 55514129 |
12 | 2ba5a220 |
13 | 19266c57 |
14 | 10325796 |
15 | 960de8c |
hex | 66281b8 |
107119032 has 32 divisors (see below), whose sum is σ = 271470480. Its totient is φ = 35216640.
The previous prime is 107119031. The next prime is 107119037. The reversal of 107119032 is 230911701.
It is a super-2 number, since 2×1071190322 = 22948974033234048, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 107118993 and 107119011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107119031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28819 + ... + 32322.
Almost surely, 2107119032 is an apocalyptic number.
107119032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107119032 is an abundant number, since it is smaller than the sum of its proper divisors (164351448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107119032 is a wasteful number, since it uses less digits than its factorization.
107119032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61223 (or 61219 counting only the distinct ones).
The product of its (nonzero) digits is 378, while the sum is 24.
The square root of 107119032 is about 10349.8324624121. The cubic root of 107119032 is about 474.9219180980.
The spelling of 107119032 in words is "one hundred seven million, one hundred nineteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •