6335
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 2401
- 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
- 4320
- Möbius Function
- -1
- Radical
- 6335
- 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
- 155
- 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
- Numbers k such that 2*3^k - 1 is prime.at n=22A003307
- a(n) = (d(n)-r(n))/5, where d = A026043 and r is the periodic sequence with fundamental period (0,2,3,0,0).at n=42A026045
- Gaps of 8 in sequence A038593 (upper terms).at n=6A038656
- Numbers that are divisible by 5 and are the difference between two (different positive) cubes in at least one way.at n=29A038853
- Numbers ending with '5' that are the difference of two positive cubes.at n=20A038860
- a(n) = (n+5)^3 - n^3.at n=18A038867
- Related to enumeration of edge-rooted catafusenes.at n=7A039919
- Numbers whose base-5 representation contains exactly three 0's and two 2's.at n=29A045186
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=27A046405
- Distinct odd numbers in the numerators of the 1/4-Pascal triangle (by row).at n=52A046586
- Numbers k such that A055079(k) = 2^k.at n=20A057838
- a(n) is the number of different graphs drawn in the following way: you decide for each number k <= n on a pair of positive numbers (x(k),y(k)) such that x(k)+y(k)=k; you draw n points numbered 1 to n; draw two arrows from n, one to x(n) and one to y(n); draw two arrows from each k already reached by an arrow, one to x(k) and one to y(k). The process stops when 1 is the only point reached by an arrow without any arrow leaving it; you can also erase the isolated points.at n=15A058050
- a(n) = Sum_{i=n+1..2n} prime(i) - Sum_{i=1..n} prime(i).at n=34A077354
- a(n) = (2*6^n - (5^n - 3^n))/2.at n=5A083316
- a(n) = 6*n*(n-1) - 1.at n=33A103115
- Numbers k such that 2^(k+1) + 3^k is prime.at n=42A123924
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (2,3,3,...) and super- and subdiagonals (1,1,1,...).at n=29A124733
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (n^2 +n -1)*T(n-2, k-1), read by rows.at n=33A154233
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (n^2 +n -1)*T(n-2, k-1), read by rows.at n=30A154233
- The z^2 coefficients of the polynomials in the GF4 denominators of A156933.at n=3A157708