6908
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13272
- Proper Divisor Sum (Aliquot Sum)
- 6364
- 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
- 3120
- Möbius Function
- 0
- Radical
- 3454
- Omega Function (Ω)
- 4
- 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
- 57
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 n such that 215*2^n-1 is prime.at n=18A050859
- Number of labeled mobiles with cycles of length at least 3.at n=7A052522
- Backwards row convergent of triangle A096811, in which A096811(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and (k-2).at n=13A096813
- Numbers k such that the k-th semiprime == 9 (mod k).at n=10A106134
- Fibonacci(p-J(p,5)) mod p^2, where p is the n-th prime and J is the Jacobi symbol.at n=36A113650
- Poincaré series [or Poincare series] P(C_{3,2}(0); t).at n=25A124636
- Numbers k such that Mordell's equation y^2 = x^3 - k has exactly 10 integral solutions.at n=14A179169
- Riordan array ((1/(1-x))^m, x*A000108(x)), m = 2.at n=58A185943
- Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=24A188148
- Number of length-n Catalan-RGS (restricted growth strings) such that the RGS is a valid mixed-radix number in falling factorial basis.at n=10A206464
- Numbers n such that 8^n + 3 is prime.at n=21A217354
- a(n) = n*(n+1) + (n+2)*(n+3) + (n+4)*(n+5) + (n+6)*(n+7).at n=38A217776
- Number of n X 3 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=7A224033
- T(n,k)=Number of nXk 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=52A224038
- Number of (n+1) X (2+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=2A234985
- Number of (n+1) X (3+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=1A234986
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=7A234991
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=8A234991
- Number of compositions of n with exactly five occurrences of the largest part.at n=16A243740
- Number of length n+3 0..3 arrays with no pair in any consecutive four terms totalling exactly 3.at n=6A246474