10869
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14496
- Proper Divisor Sum (Aliquot Sum)
- 3627
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7244
- Möbius Function
- 1
- Radical
- 10869
- 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
- 68
- Smith Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- Denominators of continued fraction convergents to sqrt(647).at n=8A042243
- Triangle read by rows giving numbers of paths in a lattice satisfying certain conditions.at n=54A071944
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).at n=53A071946
- Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).at n=54A071946
- a(n) = Sum_{k=0..floor(n/3)} (binomial(n+1, k)*binomial(2*n-3*k, n-3*k)/(n+1)).at n=9A071969
- Triangle in A071944 with rows reversed.at n=45A108074
- Triangle in A071946 with rows reversed.at n=45A108076
- Triangle in A071946 with rows reversed.at n=46A108076
- Semiprimes in A054567.at n=20A113692
- Duplicate of A071969.at n=9A119255
- Number A(Bn,K) of all D-invariant ideals of the algebra NBn(K) of classical type over a field K if 2K=0.at n=6A135512
- Nearest integer to 1 / Sum_{p prime, 2^n < p <= 2^(n+1)} (Kronecker(-1/p)/p).at n=12A166510
- Numbers k such that 4^k + 25 is prime.at n=30A204388
- a(n) = 16*n^2 + 2*n + 1.at n=26A204675
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=32A208181
- Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=12A208182
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >=n.at n=12A210366
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having nonzero determinant, with rows and columns of the latter in lexicographically nondecreasing order.at n=12A227554
- Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of 1s) is not a part.at n=41A241509
- G.f.: Sum_{n=-oo..+oo} x^n * (1 - x^n)^(3*n).at n=38A268298