5508
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 15246
- Proper Divisor Sum (Aliquot Sum)
- 9738
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1728
- Möbius Function
- 0
- Radical
- 102
- Omega Function (Ω)
- 7
- 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
- 160
- 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) = 9*binomial(2n,n-4)/(n+5).at n=5A001392
- a(n) is the number of Dyck paths of semilength n+6 having its first peak at height n+1.at n=8A005557
- Coordination sequence T5 for Zeolite Code EUO.at n=46A008100
- First differences give (essentially) A028242.at n=36A035107
- Triangle formed from even-numbered columns of triangle of expansions of powers of x in terms of Chebyshev polynomials U_n(x).at n=49A039599
- a(n) = n^3 - n^2.at n=18A045991
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=25A046963
- T(n,k)=M(2n,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.at n=49A050145
- T(n,k)=M(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array M as in A050144.at n=39A050154
- Triangle T(n,k), k>=0 and n>=1, read by rows defined by: T(n,k) = (2k+3)*binomial(2n,n-k-1)/(n+k+2).at n=39A050155
- Triangle read by rows: T(n,k) = M(2n+1,k,-1), 0 <= k <= n, n >= 0, array M as in A050144.at n=50A050165
- Numbers k such that phi(x) = k has exactly 10 solutions.at n=28A060673
- When expressed in base 3 and then interpreted in base 6, is a multiple of the original number.at n=49A062865
- For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.at n=50A066286
- Trajectory of 442 under the Reverse and Add! operation carried out in base 2.at n=4A075268
- a(n) = A051612(n)*A065387(n) = sigma(n)^2-phi(n)^2, where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).at n=44A077101
- Number of binary polynomials of degree n irreducible over the integers.at n=13A087482
- Fifth column (m=4) of (1,3)-Pascal triangle A095660.at n=15A095661
- Values of n for which A095777(n) is 16 (those terms which are expressible in decimal digits for bases 2 through 17, but not for base 18).at n=13A095785
- n! * Sum[k=floor(n/2)..n, 1/k].at n=5A101612