12606
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27648
- Proper Divisor Sum (Aliquot Sum)
- 15042
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3800
- Möbius Function
- 1
- Radical
- 12606
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 156
- 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
- Number of integer points (x,y,z) at distance <= 0.5 from sphere of radius n.at n=32A016728
- 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 74.at n=34A031572
- Denominators of continued fraction convergents to sqrt(134).at n=13A041245
- Numbers with exactly 4 distinct palindromic prime factors.at n=28A046402
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of y for n == 2 mod 4.at n=27A053374
- Molien series for complete weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.at n=9A092548
- Imaginary part of absolute Gaussian perfect numbers, in order of increasing magnitude.at n=24A102532
- Triangle, rows = inverse binomial transforms of A073133 columns.at n=31A117936
- Triangle read by rows: T(n, k) = Sum_{j=0..n} C(j, n-k) * C(j, k) * (-1)^(n - j).at n=49A176331
- Triangle read by rows: T(n, k) = Sum_{j=0..n} C(j, n-k) * C(j, k) * (-1)^(n - j).at n=50A176331
- The number of partitions of n into at least 3 parts from which we can form every partition of n into 3 parts by summing elements.at n=38A236970
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7.at n=13A251887
- Numbers n such that 3*n and n^3 have the same digit sum.at n=28A260906
- Positive numbers k such that -k, -(k + 1), and -(k + 2) are 3 consecutive negative negaFibonacci-Niven numbers (A331088).at n=32A331090
- a(n) is the number of vertices formed by n-secting the angles of a hexagon.at n=38A335734
- Number T(n,k) of endofunctions on [n] with exactly k fixed points, none of which are isolated; triangle T(n,k), n >= 0, 0 <= k <= n/2, read by rows.at n=13A350454
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x^2.at n=40A368150