Base | Representation |
---|---|
bin | 1101000001000… |
… | …11000110010101 |
3 | 21121110201022001 |
4 | 12200203012111 |
5 | 210423230134 |
6 | 14500235301 |
7 | 2464101502 |
oct | 640430625 |
9 | 247421261 |
10 | 109195669 |
11 | 56702360 |
12 | 3069bb31 |
13 | 1981322b |
14 | 107064a9 |
15 | 98be414 |
hex | 6823195 |
109195669 has 8 divisors (see below), whose sum is σ = 122028480. Its totient is φ = 96847200.
The previous prime is 109195661. The next prime is 109195753. The reversal of 109195669 is 966591901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 109195669 - 23 = 109195661 is a prime.
It is a super-2 number, since 2×1091956692 = 23847388256715122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109195661) 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 7 ways as a sum of consecutive naturals, for example, 120609 + ... + 121510.
It is an arithmetic number, because the mean of its divisors is an integer number (15253560).
Almost surely, 2109195669 is an apocalyptic number.
It is an amenable number.
109195669 is a deficient number, since it is larger than the sum of its proper divisors (12832811).
109195669 is a wasteful number, since it uses less digits than its factorization.
109195669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242171.
The product of its (nonzero) digits is 131220, while the sum is 46.
The square root of 109195669 is about 10449.6731527833. The cubic root of 109195669 is about 477.9712829162.
It can be divided in two parts, 1091956 and 69, that added together give a square (1092025 = 10452).
The spelling of 109195669 in words is "one hundred nine million, one hundred ninety-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •