Base | Representation |
---|---|
bin | 1100110000110… |
… | …00111111001100 |
3 | 21110110001201210 |
4 | 12120120333030 |
5 | 204401311400 |
6 | 14342334420 |
7 | 2436653553 |
oct | 630307714 |
9 | 243401653 |
10 | 107057100 |
11 | 55481647 |
12 | 2ba2a410 |
13 | 192449c7 |
14 | 1030ad9a |
15 | 95ea950 |
hex | 6618fcc |
107057100 has 108 divisors (see below), whose sum is σ = 318766056. Its totient is φ = 27740160.
The previous prime is 107057053. The next prime is 107057101. The reversal of 107057100 is 1750701.
It is a super-3 number, since 3×1070571003 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a zygodrome in base 2.
It is not an unprimeable number, because it can be changed into a prime (107057101) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 554604 + ... + 554796.
Almost surely, 2107057100 is an apocalyptic number.
107057100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 107057100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159383028).
107057100 is an abundant number, since it is smaller than the sum of its proper divisors (211708956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107057100 is a wasteful number, since it uses less digits than its factorization.
107057100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296 (or 246 counting only the distinct ones).
The product of its (nonzero) digits is 245, while the sum is 21.
The square root of 107057100 is about 10346.8400973437. The cubic root of 107057100 is about 474.8303734118.
The spelling of 107057100 in words is "one hundred seven million, fifty-seven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •