109
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 110
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 108
- Möbius Function
- -1
- Radical
- 109
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 113
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 29
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertneun· ordinal: einshundertneunste
- English
- one hundred nine· ordinal: one hundred ninth
- Spanish
- ciento nueve· ordinal: 109º
- French
- cent neuf· ordinal: cent neufième
- Italian
- centonove· ordinal: 109º
- Latin
- centum novem· ordinal: 109.
- Portuguese
- cento e nove· ordinal: 109º
Appears in sequences
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=53A000028
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=54A000069
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=34A000134
- A Beatty sequence: floor(n*(e-1)).at n=63A000210
- Number of partitions into non-integral powers.at n=2A000397
- Numbers that are the sum of 2 nonzero squares.at n=38A000404
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=36A000415
- Primes and squares of primes.at n=32A000430
- Number of bipartite partitions of n white objects and 4 black ones.at n=4A000465
- Number of acyclic quaternary ammonium ions with n carbon atoms.at n=6A000633
- Number of paraffins C_n H_{2n-1} X_3 with n carbon atoms.at n=6A000641
- Numbers k such that (1,k) is "good".at n=4A000696
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=46A000705
- Numbers beginning with a vowel in English.at n=23A000852
- Numbers ending with a vowel in American English.at n=51A000861
- Numbers beginning with letter 'o' in English.at n=10A000865
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=4A000922
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=23A000945
- Number of free nonplanar polyenoids with n nodes.at n=3A000953
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=11A000960