4395
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 2661
- 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
- 2336
- Möbius Function
- -1
- Radical
- 4395
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 126
- 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
- Number of indefinitely growing n-step self-avoiding walks on Manhattan lattice.at n=14A006745
- Coordination sequence T1 for Zeolite Code LOV.at n=44A008134
- Powers of fifth root of 20 rounded up.at n=14A018173
- Number of partitions of n into 7 unordered relatively prime parts.at n=37A023027
- a(n) = (1/4)*(3 + Sum_{k=0..n} C(4k,k)).at n=5A024720
- 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 21.at n=26A031519
- a(n) = 2*n^3 + 1.at n=13A033562
- Numbers k such that k^12 == 1 (mod 13^3).at n=24A056086
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n.at n=32A057289
- Triangle T(n,k), 0<=k<=n, read by rows, defined by: T(n,k)=0 if k>n, T(n,0) = A000108(n); T(n+1,k)= Sum_{j=0..n} T(n-j,k-1)*binomial(2j+1,j+1).at n=40A090285
- The sixth column of triangle A091492, excluding leading zeros.at n=39A091498
- Number of dissections of a polygon using strictly disjoint diagonals.at n=11A093128
- Riordan array (1/sqrt(1-6x+5x^2),x/(1-6x+5x^2)).at n=31A111965
- Terms in A112039 that are divisible by 3, divided by 3.at n=11A112040
- Connell (5,3)-sum sequence (partial sums of the (5,3)-Connell sequence).at n=44A122795
- Number of n X n binary arrays, symmetric under 180 degree rotation, with every 1 adjacent to at least one other 1, but at most one 1 adjacent horizontally and at most one 1 adjacent vertically.at n=5A144059
- a(n) = n^2 + 52*n + 30.at n=45A155461
- a(n) = 338*n + 1.at n=12A158000
- a(n) = 169n + 1.at n=25A158221
- a(n) = 26*n^2 + 1.at n=13A158549