9143
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9408
- Proper Divisor Sum (Aliquot Sum)
- 265
- 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
- 8880
- Möbius Function
- 1
- Radical
- 9143
- 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
- 60
- 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
- Sort-then-add sequence: a(n+1) = a(n) + sort(a(n)).at n=15A033860
- Sort then Add, a(1)=25.at n=11A033902
- Sort then Add, a(1)=32.at n=10A033907
- Denominators of continued fraction convergents to sqrt(752).at n=8A042449
- Honaker's triangle problem: form a triangle with base of length n, all entries different, all row sums equal; a(n) gives minimal row sum.at n=38A047837
- a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.at n=38A047873
- Number of unlabeled 3-gonal cacti having n triangles.at n=9A054423
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 83 ).at n=32A063356
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=13A064112
- Least nontrivial multiple of the n-th prime beginning with 9.at n=47A078293
- Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 1 that start at an odd level.at n=61A102405
- Numbers n such that Lucas(prime(n)) is prime, where Lucas = A000032.at n=41A120561
- One-seventh of the difference of squares of legs of primitive Pythagorean triangles, neither of which is a multiple of 7.at n=35A127924
- A determinant sequence: M={{a(-1 + n), a(-2 + n), a(-3 + n)}, {a(-2 + n), a(-3 + n), a(-4 + n)}, {a(-3 + n), a(-4 + n), a(-5 + n)}} a(n)=Det[M].at n=8A142711
- Similar to A072921 but starting with 5.at n=40A152234
- a(n) = 441*n^2 - 394*n + 88.at n=4A157734
- n-th single or isolated number*n-th non-single or nonisolated number.at n=33A167885
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210739; see the Formula section.at n=52A210740
- 7^n mod 10000.at n=38A216130
- a(n) = smallest number greater than n, equal to the determinant of the circulant matrix formed by its base-n digits.at n=36A219357