5674
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8514
- Proper Divisor Sum (Aliquot Sum)
- 2840
- 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
- 2836
- Möbius Function
- 1
- Radical
- 5674
- 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
- 36
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T3 for Zeolite Code VNI.at n=46A009909
- Numbers k such that the continued fraction for sqrt(k) has period 69.at n=6A020408
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 1, 2, 2.at n=12A025244
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 21.at n=1A031609
- Numbers whose base-4 representation contains exactly two 1's and four 2's.at n=21A045099
- Numbers whose base-5 representation contains exactly two 1's and three 4's.at n=34A045258
- Floor(cube root(concatenation of first n cubes)).at n=5A067125
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=22A096906
- Diagonal sums of binomial-Möbius product.at n=12A101510
- Reversible Smith numbers, i.e., Smith numbers whose reversal is also a Smith number.at n=42A104171
- Triangle of the sum of squared coefficients of q in the q-binomial coefficients, read by rows.at n=70A125806
- Triangle of the sum of squared coefficients of q in the q-binomial coefficients, read by rows.at n=73A125806
- a(n) = Fibonacci(n) mod n^3.at n=30A132636
- Number of nondecreasing integer sequences of length 6 with sum zero and sum of absolute values 2n.at n=22A158140
- Numbers k such that Sum_{i=1..k} i^7 divides Product_{i=1..k} i^7.at n=6A166607
- Semiprime centered triangular numbers.at n=24A184481
- Number of (n+2) X 8 binary arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=11A190030
- Expansion of x^4*(2-6*x+5*x^2+2*x^3-4*x^4)/((1-x)^2*(1-2*x)^5).at n=9A219758
- 1-Fibonacci lattice paths.at n=9A230122
- For n > 1 the sum of t := floor(n/2) + 1 consecutive previous terms, the leading t terms when n is even, the immediately-preceding t terms when n is odd; a(0) = 0, a(1) = 1.at n=42A238834