1119
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1496
- Proper Divisor Sum (Aliquot Sum)
- 377
- 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
- 744
- Möbius Function
- 1
- Radical
- 1119
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 88
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Describe the previous term! (method A - initial term is 9).at n=2A001154
- Related to series-parallel networks.at n=10A001572
- Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.at n=26A003458
- Number of triangles with integer sides and area = n times perimeter.at n=35A007237
- Coordination sequence T3 for Zeolite Code AFO.at n=22A008017
- Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-2,n).at n=5A010736
- Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x.at n=33A011117
- a(n) = n^2 + 3*n - 1.at n=32A014209
- Composite n such that phi(n) * sigma(n) is one less than a square.at n=19A015709
- Odd composite n such that phi(n) * sigma(n) is one less than a square.at n=7A015722
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8).at n=31A017830
- Numbers k such that the continued fraction for sqrt(k) has period 14.at n=51A020353
- Index of 3^n within sequence of numbers of form 3^i*5^j.at n=56A022339
- Expansion of Product_{m>=1} (1 - m*q^m)^2.at n=24A022662
- Place where n-th 1 occurs in A023123.at n=28A022785
- Numbers k such that Fibonacci(k) == -2 (mod k).at n=20A023163
- Index of 3^n within the sequence of the numbers of the form 3^i*4^j.at n=52A025696
- Index of 9^n within the sequence of the numbers of the form 8^i*9^j.at n=45A025738
- Odd n such that in n^2 the parity of digits alternates.at n=39A030155
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 22.at n=12A031520