Base | Representation |
---|---|
bin | 1100110100101… |
… | …01010011000000 |
3 | 21111101221012000 |
4 | 12122111103000 |
5 | 210014110042 |
6 | 14401304000 |
7 | 2444204202 |
oct | 632252300 |
9 | 244357160 |
10 | 107566272 |
11 | 5579a150 |
12 | 30035000 |
13 | 193926a8 |
14 | 10400772 |
15 | 969b74c |
hex | 66954c0 |
107566272 has 112 divisors (see below), whose sum is σ = 345033600. Its totient is φ = 32590080.
The previous prime is 107566243. The next prime is 107566273. The reversal of 107566272 is 272665701.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (107566273) 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 15 ways as a sum of consecutive naturals, for example, 16179 + ... + 21837.
Almost surely, 2107566272 is an apocalyptic number.
107566272 is a gapful number since it is divisible by the number (12) 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 107566272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172516800).
107566272 is an abundant number, since it is smaller than the sum of its proper divisors (237467328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107566272 is a wasteful number, since it uses less digits than its factorization.
107566272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5691 (or 5675 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 36.
The square root of 107566272 is about 10371.4161038886. The cubic root of 107566272 is about 475.5819600185.
The spelling of 107566272 in words is "one hundred seven million, five hundred sixty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •