9748
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17066
- Proper Divisor Sum (Aliquot Sum)
- 7318
- 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
- 4872
- Möbius Function
- 0
- Radical
- 4874
- Omega Function (Ω)
- 3
- 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
- 135
- 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) is the solution to the postage stamp problem with 6 denominations and n stamps.at n=13A001211
- Number of triples (i,j,k) with 1 <= i < j < k <= n and gcd(i,j,k) = 1.at n=41A015616
- Number of triples of different integers from [ 2,n ] with no global factor.at n=41A015618
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=13A031826
- Number of rooted identity trees with n nodes and 4-colored non-root nodes.at n=6A052772
- Largest n-digit member of A089395.at n=3A089397
- Number of Motzkin paths of length n in 3D with no level steps at odd level.at n=8A118677
- a(n) = 361*n + 1.at n=26A158310
- a(n) = 13*n^2 + 10*n + 1.at n=27A161587
- Parameters n for which the elliptic curve y^2=x^3-n has rank 4.at n=8A179137
- Numbers n such that Mordell's equation y^2 = x^3 - n has exactly 18 integral solutions.at n=1A179173
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 7 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=3*floor(n/2), read by rows.at n=46A238555
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 8 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=4*floor(n/2), read by rows.at n=45A238557
- Absolute discriminants of complex quadratic fields with 3-class rank 2.at n=6A242862
- Absolute discriminants of complex quadratic fields with 3-class group of elementary abelian type (3,3) of rank 2.at n=4A242863
- Absolute discriminants of complex quadratic fields with 3-class group of type (3,3) and Hilbert 3-class field tower of exact length 3, except for the cases mentioned in the COMMENTS.at n=0A242878
- Minimal absolute discriminants a(n) of complex quadratic fields with 3-class group of type (3,3), 3-principalization type E.9 (2334), and second 3-class group G of odd nilpotency class cl(G)=2(n+2)+1.at n=0A247696
- Number A(n,k) of rooted identity trees with n nodes and k-colored non-root nodes; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=61A255517
- a(n) = Sum_{k=1..n} (-1)^(k+1) * lcm(n,k) / gcd(n,k).at n=37A333493
- Number of endless self-avoiding walks of length n for the square lattice.at n=8A334322