10248
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 29760
- Proper Divisor Sum (Aliquot Sum)
- 19512
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- 0
- Radical
- 2562
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 55
- 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
- arctan(arcsinh(x)*arctan(x))=2/2!*x^2-12/4!*x^4-2/6!*x^6+10248/8!*x^8...at n=4A012626
- Expansion of e.g.f. tanh(arcsinh(x)*arctan(x)) (only even powers).at n=4A012629
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,5).at n=26A018917
- a(n) = [ 1/(2*t(n+1) - t(n) - t(n+2)) ], where t(n) = tan(Pi/2 - 1/n) satisfies n-1 < t(n) < n for all n >= 1.at n=17A024817
- Numbers with exactly five distinct base-10 digits.at n=10A031987
- Shifts left under "CFJ" (necklace, size, labeled) transform.at n=8A032138
- Triangle of coefficients of Gandhi polynomials.at n=18A036970
- Denominators of continued fraction convergents to sqrt(135).at n=15A041247
- Numbers whose base-4 representation contains exactly four 0's and three 2's.at n=11A045060
- a(n) in base 11 is a repdigit.at n=37A048335
- a(n) = T(2n,n), where T is the array in A055830.at n=7A055834
- Number of positions that are exactly n moves from the starting position in the Skewb puzzle.at n=5A079745
- Number of positions that are exactly n moves from the starting position in the Ultimate Skewb puzzle.at n=5A079758
- a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k.at n=21A089493
- Numbers that can be expressed as the difference of the squares of primes in exactly four distinct ways.at n=28A092000
- Another version of triangular array in A036970: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 2, 4, 6, 9, 12, 16, 20, 25, 30, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] where DELTA is the operator defined in A084938.at n=25A094346
- Triangle read by rows: a(n,k) = number of Dyck n-paths such that number of DUs at level 1 plus number of UDs at level 2 is k, 0<=k<=n-1.at n=57A096794
- Triangle read by rows: T(n,k) is the number of alternating permutations on [n+1] with 1 in position k+1, 0<=k<=n.at n=51A104345
- Triangle read by rows: T(n,k) is the number of alternating permutations on [n+1] with 1 in position k+1, 0<=k<=n.at n=48A104345
- Number of compositions of n into 4 parts such that no two adjacent parts are equal.at n=37A106353