6135
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
- 9840
- Proper Divisor Sum (Aliquot Sum)
- 3705
- 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
- 3264
- Möbius Function
- -1
- Radical
- 6135
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 62
- 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
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=33A027578
- 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 15.at n=43A031513
- Expansion of 1/(1-x)^2/(1-x^2)/(1-x^3)/(1-x^5)/(1-x^8).at n=35A034379
- Sums of 11 distinct powers of 2.at n=19A038462
- Numbers whose base-4 representation contains exactly three 1's and four 3's.at n=3A045128
- Periods associated with A040017.at n=55A051627
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives j values.at n=9A054206
- Fifth diagonal (m=4) of triangle A084938; a(n) = A084938(n+4,n) = (n^4 + 18*n^3 + 131*n^2 + 426*n)/24.at n=15A090386
- Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.at n=43A090424
- McKay-Thompson series of class 18g for the Monster group.at n=49A112156
- Floor(exp(n)/n^2).at n=13A132405
- Triangle, read by rows, that transforms diagonals in the table of coefficients in the successive iterations of x+x^2 (cf. A122888).at n=40A135080
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1101-0111-0100 pattern in any orientation.at n=15A146859
- Directed genus of the binary de Bruijn graph D_n.at n=14A151998
- A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=2; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) - m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=30A157180
- A new general triangle sequence based on the Eulerian form in three parts ( subtraction):m=2; t0(n,k)=If[n*k == 0, 1, Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}]] t(n,k,m)=If[n == 0, 1, ( m*(n - k) + 1)*t0(n - 1 + 1, k - 1) + (m*k + 1)*t0(n - 1 + 1, k) - m*k*(n - k)*t0(n - 2 + 1, k - 1)].at n=33A157180
- Total number of n-digit numbers requiring 14 positive biquadrates in their representation as sum of biquadrates.at n=4A186674
- Number of perfect powers (A001597) < 2^n.at n=25A188951
- Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=15A192761
- Minimal natural number (in decimal representation) with n prime substrings in binary representation (substrings with leading zeros are considered to be nonprime).at n=39A217302