Base | Representation |
---|---|
bin | 1100111111111… |
… | …00000110010111 |
3 | 21121011121011200 |
4 | 12133330012113 |
5 | 210403122202 |
6 | 14453003543 |
7 | 2462535000 |
oct | 637740627 |
9 | 247147150 |
10 | 109035927 |
11 | 56603340 |
12 | 306235b3 |
13 | 19788600 |
14 | 106a41a7 |
15 | 988be1c |
hex | 67fc197 |
109035927 has 144 divisors (see below), whose sum is σ = 228384000. Its totient is φ = 49533120.
The previous prime is 109035923. The next prime is 109035931. The reversal of 109035927 is 729530901.
It is an interprime number because it is at equal distance from previous prime (109035923) and next prime (109035931).
It is not a de Polignac number, because 109035927 - 22 = 109035923 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 109035891 and 109035900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109035923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 5738724 + ... + 5738742.
It is an arithmetic number, because the mean of its divisors is an integer number (1586000).
Almost surely, 2109035927 is an apocalyptic number.
109035927 is an abundant number, since it is smaller than the sum of its proper divisors (119348073).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109035927 is a wasteful number, since it uses less digits than its factorization.
109035927 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83 (or 53 counting only the distinct ones).
The product of its (nonzero) digits is 17010, while the sum is 36.
The square root of 109035927 is about 10442.0269584023. The cubic root of 109035927 is about 477.7380949414.
The spelling of 109035927 in words is "one hundred nine million, thirty-five thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •