12886
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 7634
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- -1
- Radical
- 12886
- 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
- 76
- 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 triples of different integers from [ 2,n ] with no global factor.at n=45A015618
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=17A020437
- Numbers k > 1 such that, in base 5, k and k^2 contain the same digits in the same proportion.at n=4A061659
- Number of ways to place zero or more nonadjacent 1,1 2,1 2,2 3,1 4,1 5,0 5,1 6,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155365
- Number of n-leaf binary trees that do not contain (()(()(()((()())())))) as a subtree.at n=10A159768
- Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=17A166796
- Number of (n+2)X5 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=4A202772
- Number of (n+2)X7 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=2A202774
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=23A202777
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=25A202777
- First column of A316273. Recurrence similar to series reversion giving Catalan numbers.at n=11A239605
- Let { d_1, d_2, ..., d_k } be the divisors of n. Then a(n) = d_k^1 + d_(k-1)^2 + ... + d_1^k.at n=39A264786
- Number of compositions of n into parts 1, 7, and 8.at n=37A276106
- Number of distinct non-subset-sums of integer partitions of n.at n=28A365918