12644
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23100
- Proper Divisor Sum (Aliquot Sum)
- 10456
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 6322
- 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
- 156
- 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
- a(n) = (9*n+1)*(9*n+8).at n=12A001534
- The partition function G(n,3).at n=9A001680
- From discordant permutations.at n=6A002634
- a(n) = floor(n*phi^14), where phi is the golden ratio, A001622.at n=15A004929
- Number of terms in n-th derivative of a function composed with itself 8 times.at n=8A024208
- Matrix 8th power of partition triangle A008284.at n=28A050302
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.at n=47A085484
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.at n=52A085484
- Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 1.at n=73A101276
- Triangle t(n,m)=A039757(n,m)+A039757(n,n-m) read by rows.at n=23A155719
- Triangle t(n,m)=A039757(n,m)+A039757(n,n-m) read by rows.at n=25A155719
- Number of ways to place 3 nonattacking nightriders on a 3 X n board.at n=15A172218
- Greatest k such that floor(k/r^n)=n, where r = golden mean = (1+sqrt(5))/2.at n=13A182615
- T(n,k)=Number of (n*k)Xk binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row.at n=36A188416
- T(n,k)=Number of (n*k)Xk binary arrays with nonzero rows in decreasing order, no more than 3 ones in any row and exactly n ones in every column.at n=36A188449
- Number of terms in n-th derivative of a function composed with itself n times.at n=7A192435
- Number of Dyck n-paths all of whose ascents have prime lengths.at n=14A210737
- Number of terms in 8th derivative of a function composed with itself n times.at n=7A215626
- Number G(n,k) of set partitions of {1,...,n} into sets of size at most k; triangle G(n,k), n>=0, 0<=k<=n, read by rows.at n=48A229223
- Number of set partitions of {1,...,n^2} into sets of size at most n.at n=3A229229