Base | Representation |
---|---|
bin | 1101000011100… |
… | …01100101100000 |
3 | 21122002001021211 |
4 | 12201301211200 |
5 | 211014022102 |
6 | 14511155504 |
7 | 2466610663 |
oct | 641614540 |
9 | 248061254 |
10 | 109517152 |
11 | 56901948 |
12 | 30815b94 |
13 | 198c6664 |
14 | 1078b6da |
15 | 99347d7 |
hex | 6871960 |
109517152 has 12 divisors (see below), whose sum is σ = 215611956. Its totient is φ = 54758560.
The previous prime is 109517113. The next prime is 109517153. The reversal of 109517152 is 251715901.
It is a super-2 number, since 2×1095171522 = 23988013164382208, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109517153) 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 as a sum of consecutive naturals, namely, 1711174 + ... + 1711237.
It is an arithmetic number, because the mean of its divisors is an integer number (17967663).
Almost surely, 2109517152 is an apocalyptic number.
It is an amenable number.
109517152 is a deficient number, since it is larger than the sum of its proper divisors (106094804).
109517152 is an equidigital number, since it uses as much as digits as its factorization.
109517152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3422421 (or 3422413 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 31.
The square root of 109517152 is about 10465.0442903984. The cubic root of 109517152 is about 478.4398884724.
The spelling of 109517152 in words is "one hundred nine million, five hundred seventeen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •