Base | Representation |
---|---|
bin | 1100110010010… |
… | …01000000000000 |
3 | 21110211001111111 |
4 | 12121021000000 |
5 | 204424110020 |
6 | 14350453104 |
7 | 2441433115 |
oct | 631110000 |
9 | 243731444 |
10 | 107253760 |
11 | 555a6379 |
12 | 2bb04194 |
13 | 192b3383 |
14 | 1035c90c |
15 | 9638d5a |
hex | 6649000 |
107253760 has 52 divisors (see below), whose sum is σ = 257426748. Its totient is φ = 42893312.
The previous prime is 107253749. The next prime is 107253779. The reversal of 107253760 is 67352701.
It can be written as a sum of positive squares in 2 ways, for example, as 67108864 + 40144896 = 8192^2 + 6336^2 .
It is a nialpdrome in base 8.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17862 + ... + 23098.
Almost surely, 2107253760 is an apocalyptic number.
107253760 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 107253760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128713374).
107253760 is an abundant number, since it is smaller than the sum of its proper divisors (150172988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107253760 is an frugal number, since it uses more digits than its factorization.
107253760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5266 (or 5244 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 31.
The square root of 107253760 is about 10356.3391215236. The cubic root of 107253760 is about 475.1209442719.
The spelling of 107253760 in words is "one hundred seven million, two hundred fifty-three thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •