Base | Representation |
---|---|
bin | 1100111111111… |
… | …01011101100011 |
3 | 21121011212211100 |
4 | 12133331131203 |
5 | 210403312012 |
6 | 14453045443 |
7 | 2462560161 |
oct | 637753543 |
9 | 247155740 |
10 | 109041507 |
11 | 56607553 |
12 | 30626883 |
13 | 1978b003 |
14 | 106a6231 |
15 | 988d8dc |
hex | 67fd763 |
109041507 has 12 divisors (see below), whose sum is σ = 161167864. Its totient is φ = 71003520.
The previous prime is 109041503. The next prime is 109041521. The reversal of 109041507 is 705140901.
It is not a de Polignac number, because 109041507 - 22 = 109041503 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109041503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 140494 + ... + 141267.
Almost surely, 2109041507 is an apocalyptic number.
109041507 is a deficient number, since it is larger than the sum of its proper divisors (52126357).
109041507 is a wasteful number, since it uses less digits than its factorization.
109041507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281810 (or 281807 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 109041507 is about 10442.2941444876. The cubic root of 109041507 is about 477.7462443443.
The spelling of 109041507 in words is "one hundred nine million, forty-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •