Base | Representation |
---|---|
bin | 1101000000110… |
… | …10010001101100 |
3 | 21121101212201122 |
4 | 12200122101230 |
5 | 210421101112 |
6 | 14455400112 |
7 | 2463561236 |
oct | 640322154 |
9 | 247355648 |
10 | 109159532 |
11 | 56688199 |
12 | 30683038 |
13 | 197cc951 |
14 | 106d7256 |
15 | 98b3872 |
hex | 681a46c |
109159532 has 12 divisors (see below), whose sum is σ = 192999240. Its totient is φ = 54016896.
The previous prime is 109159529. The next prime is 109159537. The reversal of 109159532 is 235951901.
It is a junction number, because it is equal to n+sod(n) for n = 109159492 and 109159501.
It is not an unprimeable number, because it can be changed into a prime (109159537) 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 3 ways as a sum of consecutive naturals, for example, 140282 + ... + 141057.
It is an arithmetic number, because the mean of its divisors is an integer number (16083270).
Almost surely, 2109159532 is an apocalyptic number.
It is an amenable number.
109159532 is a deficient number, since it is larger than the sum of its proper divisors (83839708).
109159532 is a wasteful number, since it uses less digits than its factorization.
109159532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281440 (or 281438 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 35.
The square root of 109159532 is about 10447.9439125600. The cubic root of 109159532 is about 477.9185508065.
The spelling of 109159532 in words is "one hundred nine million, one hundred fifty-nine thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.342 sec. • engine limits •