12609
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 6111
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8388
- Möbius Function
- 0
- Radical
- 1401
- Omega Function (Ω)
- 4
- 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
- 63
- 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
- no
- Odd
- yes
Appears in sequences
- A sixth-order linear divisibility sequence: a(n+6) = -3*a(n+5) - 5*a(n+4) - 5*a(n+3) - 5*a(n+2) - 3*a(n+1) - a(n).at n=26A005120
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=31A031824
- Number of winning length n strings with a 9-symbol alphabet in "same game".at n=7A065242
- sigma(n) + n is a square.at n=27A114069
- Square array where T(n,k) = Sum_{j=0..k} C(n+2*j,j)*C(n+2*j,k-j), read by antidiagonals.at n=34A137634
- a(n) = Sum_{k=0..n} C(2k+1,k)*C(2k+1,n-k) ; equals row 1 of square array A137634; also equals the convolution of A137635 and A073157.at n=6A137636
- Numerator of Euler(n, 11/31).at n=3A157692
- Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock trace equal to some horizontal or vertical neighbor 2 X 2 subblock trace.at n=4A185837
- Number of (n+1)X6 0..2 arrays with every 2X2 subblock trace equal to some horizontal or vertical neighbor 2X2 subblock trace.at n=0A185841
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock trace equal to some horizontal or vertical neighbor 2X2 subblock trace.at n=10A185845
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock trace equal to some horizontal or vertical neighbor 2X2 subblock trace.at n=14A185845
- Number of (n+1)X6 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=0A187136
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=10A187140
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2X2 subblock traces.at n=14A187140
- Digits of Pi read in decimal as if written in hexadecimal.at n=3A208935
- Number of -4..4 arrays of length n with the sum ahead of each element differing from the sum following that element by 4 or less.at n=4A221963
- T(n,k)=Number of -k..k arrays of length n with the sum ahead of each element differing from the sum following that element by k or less.at n=32A221967
- Number of -n..n arrays of length 5 with the sum ahead of each element differing from the sum following that element by n or less.at n=3A221968
- Growth series for affine Coxeter group (or affine Weyl group) D_4.at n=26A266759
- Numbers k such that (482*10^k - 41)/9 is prime.at n=17A291923