6126
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12264
- Proper Divisor Sum (Aliquot Sum)
- 6138
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2040
- Möbius Function
- -1
- Radical
- 6126
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 52.at n=35A020391
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=24A025513
- 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 52.at n=19A031550
- "CGK" (necklace, element, unlabeled) transform of 2,2,2,2,...at n=15A032156
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.at n=4A053019
- Numbers which are the sum of their proper divisors containing the digit 0.at n=29A059461
- 2nd level triangle related to Eulerian numbers and binomial transforms (triangle of Eulerian numbers is first level and triangle with Z(0,0)=1 and Z(n,k)=0 otherwise is 0th level).at n=23A062253
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.at n=38A073713
- Interprimes which are of the form s*prime, s=6.at n=44A075281
- Row sums in triangle A081994.at n=16A081997
- Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones.at n=34A102425
- Sum of ordered 3 prime sided prime triangles.at n=28A105100
- Number of riffs on n or fewer nodes. Number of rotes on 2n+1 or fewer nodes.at n=8A112846
- Positive integers n such that S(n) divides n, where S(n) is the sum of the iterates of the Euler phi-function of n, that is, S(n) = phi(n)+phi(phi(n))+....+ 1.at n=38A113808
- Poincaré series [or Poincare series] P(C^o_{4,2}; x).at n=8A124634
- Expansion of eta(q^3) * eta(q^33) / ( eta(q)* eta(q^11)) in powers of q.at n=39A128663
- Set m = 0, n = 1. Find smallest k >= 2 such that pi(k) = (k-pi(k)) - (m-pi(m)); set a(n) = pi(k), m = k, n = n+1. Repeat.at n=41A131872
- Convolution of A008619 and A001400.at n=26A139672
- Row sums of triangle A144334, binomial transform of [1, 2, 6, 7, 3, 0, 0, 0, ...].at n=14A144335
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 0, 1), (1, 0, 1), (1, 1, 0)}.at n=7A150376