17248
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 43092
- Proper Divisor Sum (Aliquot Sum)
- 25844
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 154
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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) = n*(n+4)*(n+5)/6.at n=44A005586
- Coordination sequence for alpha-Mn, Position Mn4.at n=34A009953
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 65.at n=38A031563
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) properly contained in the digits of a(n+1)^3, with a(0)=1.at n=7A067971
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) contained in the digits of a(n+1)^3, with a(0)=1.at n=8A067973
- Numbers n such that phi(n) is the sum of the first k divisors of n for some k.at n=19A072278
- Triangle read by rows: T(n,k) is number of leaves at level k in all noncrossing rooted trees on n+1 nodes.at n=32A101372
- Records in A111229.at n=35A111270
- a(n) = (n-2)*(n+3)*(n+2)/6.at n=46A129936
- Numbers n with all digits different, such that all of its digits divide n, but none of the nonzero digits not in n divide n.at n=15A133606
- Matrix square of triangle V = A136230, read by rows.at n=32A136234
- G.f.s of the z^p coefficients of the polynomials in the GF4 denominators of A156933.at n=27A157705
- Number of lattice paths from (0,0) to (n,n) using steps S={(k,0),(0,k),(r,r)|0<k<=2,0<r<=2} which never go above the line y=x.at n=6A175935
- a(n) = Sum_{k=0..floor((n-1)/2)} (3^k-1)*binomial(n, 2*k+1).at n=8A176758
- Triangle T(n,k) read by rows: the coefficient [x^k] of the series (1-x)^(2n-1)*Sum_{l>=0} A001263(n+3*l,3*l+1)*x^l, in row n>=1 with exponents k>=0.at n=29A178658
- Numbers p^5*q^2*r where p, q, r are 3 distinct primes.at n=31A179691
- Numbers divisible by at least four of their digits, different and >1.at n=40A187238
- Number of 3-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=18A187288
- a(n) = 22*n^2.at n=28A195323
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and odd determinant.at n=14A210370