5217
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7296
- Proper Divisor Sum (Aliquot Sum)
- 2079
- 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
- 3312
- Möbius Function
- -1
- Radical
- 5217
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 147
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Coordination sequence T2 for Banalsite.at n=43A008250
- a(n) = (d(n)-r(n))/2, where d = A026054 and r is the periodic sequence with fundamental period (1,0,0,0).at n=34A026055
- a(n) = Sum_{k=0..n-3} T(n,k) * T(n,k+3), with T given by A026714.at n=4A027204
- Square root of coefficients of power series: A083352(x)^2 + A083352(x) - 1; term-by-term square root of A083353.at n=72A083354
- Number of base 19 n-digit numbers with adjacent digits differing by three or less.at n=4A126487
- Number of n X n binary arrays with all ones connected only in a 1010-1111-0101 pattern in any orientation.at n=7A147428
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1010-1111-0101 pattern in any orientation.at n=16A147430
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1010-1111-0101 pattern in any orientation.at n=17A147430
- Number of planar triangular n X n X n nonnegative integer grids with mirror symmetry about one altitude with every similarly oriented 5 X 5 X 5 subtriangle summing to 8.at n=2A154071
- a(n) = (prime(n))^2 - (nonprime(n))^2.at n=21A161757
- a(2*n+1) = 1+A131941(2*n+1). a(2*n) = A131941(2*n).at n=30A173809
- Number of n X 2 0..2 arrays with rows and columns in nondecreasing order.at n=6A184130
- Number of nX7 0..2 arrays with rows and columns in nondecreasing order.at n=1A184135
- T(n,k)=Number of nXk 0..2 arrays with rows and columns in nondecreasing order.at n=34A184137
- T(n,k)=Number of nXk 0..2 arrays with rows and columns in nondecreasing order.at n=29A184137
- Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k UDUD's, where U=(1,1) and D=(1,-1).at n=58A191791
- Number of length n left factors of Dyck paths having no UDUD's; here U=(1,1) and D=(1,-1).at n=16A191792
- G.f.: A(x) = 1 + Sum_{n>=1} x^(n^2) * ((1-x)^n + 1/(1-x)^n).at n=38A197707
- Number of (n+1) X 4 binary arrays with consecutive windows of two bits considered as a binary number nondecreasing in every row and column.at n=11A202330
- For any number n take the polynomial formed by the product of the terms (x-pi), where pi's are the prime factors of n. Then calculate the area between the minimum and the maximum value of the prime factors. This sequence lists the numbers for which the area is a positive integer.at n=32A203612