Base | Representation |
---|---|
bin | 1101000000110… |
… | …01001100000000 |
3 | 21121101122121110 |
4 | 12200121030000 |
5 | 210420430242 |
6 | 14455323320 |
7 | 2463542235 |
oct | 640311400 |
9 | 247348543 |
10 | 109155072 |
11 | 56684904 |
12 | 30680540 |
13 | 197ca900 |
14 | 106d578c |
15 | 98b239c |
hex | 6819300 |
109155072 has 162 divisors, whose sum is σ = 325799292. Its totient is φ = 32428032.
The previous prime is 109155017. The next prime is 109155077. The reversal of 109155072 is 270551901.
It is not an unprimeable number, because it can be changed into a prime (109155077) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3763954 + ... + 3763982.
Almost surely, 2109155072 is an apocalyptic number.
109155072 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 109155072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162899646).
109155072 is an abundant number, since it is smaller than the sum of its proper divisors (216644220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109155072 is an equidigital number, since it uses as much as digits as its factorization.
109155072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103 (or 47 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 30.
The square root of 109155072 is about 10447.7304712555. The cubic root of 109155072 is about 477.9120418444.
The spelling of 109155072 in words is "one hundred nine million, one hundred fifty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •