8953
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10240
- Proper Divisor Sum (Aliquot Sum)
- 1287
- 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
- 7668
- Möbius Function
- 1
- Radical
- 8953
- 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
- 140
- 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
- Related to graded partially ordered sets.at n=4A001830
- Central trinomial coefficients: largest coefficient of (1 + x + x^2)^n.at n=10A002426
- Number of symmetric, reduced unit interval schemes with n+1 intervals (n>=1).at n=20A005213
- Numbers k such that Fib(k) == 13 (mod k).at n=41A023178
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=14A031824
- Numerators of continued fraction convergents to sqrt(570).at n=4A042092
- Denominators of continued fraction convergents to sqrt(829).at n=11A042601
- Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).at n=60A056241
- Sum of the squares of the trinomial coefficients (A027907).at n=5A082758
- Except for initial 0, same as A005213.at n=20A088657
- Triangle, read by rows, such that the convolution of each row with {1,2} produces a triangle which, after the main diagonal is divided by 2 and the triangle is flattened, equals this flattened form of the original triangle.at n=55A092689
- Array read by rows: right-hand side of triangle A027907 of trinomial coefficients.at n=55A094531
- Triangle, read by rows, where the g.f. A(x,y) satisfies the equation: A(x,y) = 1/(1-x*y) + x*A(x,y) + x^2*A(x,y)^2.at n=67A105632
- Renewal array for central trinomial numbers A002426.at n=55A111960
- Riordan array (1/sqrt(1-2*x-3*x^2), M(x)-1) where M(x) is the g.f. of the Motzkin numbers A001006.at n=55A114422
- Array read by antidiagonals: consider a doubly infinite chessboard with squares labeled (i,j), i in Z, j in Z; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j).at n=55A114972
- Numbers k such that k and 8*k, taken together, are zeroless pandigital.at n=33A115932
- Riordan array (1/sqrt(1-2*x-3*x^2), (1-2*x-3*x^2)/(2*(1-3*x)) - sqrt(1-2*x-3*x^2)/2).at n=55A115990
- Riordan array (1/sqrt(1-2*x-3*x^2), 1/sqrt(1-2*x-3*x^2) -1).at n=55A116392
- Triangle whose k-th column has e.g.f. exp(x)*sum{j=0..k, Bessel_I(k+j,2x)}.at n=55A116401