Base | Representation |
---|---|
bin | 1101000100101… |
… | …10001101010000 |
3 | 21122100200001101 |
4 | 12202112031100 |
5 | 211033322102 |
6 | 14514314144 |
7 | 2501104210 |
oct | 642261520 |
9 | 248320041 |
10 | 109667152 |
11 | 569a4611 |
12 | 30888954 |
13 | 19949a0a |
14 | 107ca240 |
15 | 9963e87 |
hex | 6896350 |
109667152 has 20 divisors (see below), whose sum is σ = 242834656. Its totient is φ = 47000160.
The previous prime is 109667143. The next prime is 109667161. The reversal of 109667152 is 251766901.
It is an interprime number because it is at equal distance from previous prime (109667143) and next prime (109667161).
It is a super-2 number, since 2×1096671522 = 24053768455582208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 489474 + ... + 489697.
Almost surely, 2109667152 is an apocalyptic number.
It is an amenable number.
109667152 is an abundant number, since it is smaller than the sum of its proper divisors (133167504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109667152 is an equidigital number, since it uses as much as digits as its factorization.
109667152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 979186 (or 979180 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 37.
The square root of 109667152 is about 10472.2085540730. The cubic root of 109667152 is about 478.6582203110.
The spelling of 109667152 in words is "one hundred nine million, six hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •