1178
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1920
- Proper Divisor Sum (Aliquot Sum)
- 742
- 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
- 540
- Möbius Function
- -1
- Radical
- 1178
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 119
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 9 positive 6th powers.at n=17A003365
- a(n) = 6*n^2 + 2 for n > 0, a(0)=1.at n=14A005897
- Coordination sequence T3 for Zeolite Code LTN.at n=24A008142
- If a, b in sequence, so is ab+5.at n=21A009304
- If a, b in sequence, so is ab+6.at n=18A009307
- Coordination sequence T1 for Zeolite Code iRON.at n=24A009881
- a(0) = 1, a(n) = 24*n^2 + 2 for n>0.at n=7A010014
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=9A015850
- Numbers k such that sigma(k) = sigma(k+7).at n=5A015867
- Fibonacci sequence beginning 2, 12.at n=11A022368
- a(n) = n-2 + Sum_{i = 1..n-2} (a(i+1) mod a(i)) for n >= 3 with a(1) = a(2) = 1.at n=51A022856
- The sequence m(n) in A022905.at n=25A022907
- a(n) = a(n-1) + c(n+1) for n >= 3, a( ) increasing, given a(1)=1, a(2)=8; where c( ) is complement of a( ).at n=42A022954
- Numbers k such that Fib(k) == 21 (mod k).at n=11A023179
- a(n) = sum of the numbers between the two n's in A026358.at n=17A026361
- Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if 1 <= k <= floor(n/2), else T(n,k) = T(n-1,k-1) + T(n-1,k).at n=60A026780
- a(n) = T(2n,n), T given by A026780.at n=5A026781
- a(n) = T(n, floor(n/2)), T given by A026780.at n=10A026786
- a(n) = greatest number in row n of array T given by A026780.at n=10A027246
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=17A027419