12616
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 12584
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5904
- Möbius Function
- 0
- Radical
- 3154
- Omega Function (Ω)
- 5
- 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
- 94
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = Sum_{k=0..5} binomial(n,k).at n=18A006261
- Powers of fifth root of 12 rounded up.at n=19A018149
- Least m such that if r and s in {1/1, 1/4, 1/9,..., 1/n^2} satisfy r < s, then r < k/m < s for some integer k.at n=32A024827
- Number of binary [ n,8 ] codes without 0 columns.at n=12A034349
- Antidiagonal sums of table A083047.at n=14A083049
- Triangular array read by rows: a(n, k) is the number of ordered m-tuples of positive integers (x_1, ..., x_m) such that max x_i = n+1-m and there are k ones (0 <= k <= n).at n=56A089246
- a(n) = n-th centered n-gonal number.at n=29A100119
- Isotopy classes of Latin trades of size n.at n=13A133171
- Isotopy classes of ordered Latin bi-trades of size n.at n=13A133177
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 0), (0, -1), (0, 1), (1, -1)}.at n=10A151262
- a(n) = 841*n + 1.at n=14A158404
- Least k with precisely n partitions k = x + y satisfying sigma(k) = sigma(x) + sigma(y).at n=15A211224
- Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal, vertical or antidiagonal neighbor, and containing the value n(n+1)/2-3.at n=5A211925
- T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal, vertical or antidiagonal neighbor, and containing the value n(n+1)/2-k-1.at n=26A211930
- Number of ways to paint some (possibly none or all) of the trees over all forests on n labeled nodes.at n=6A218691
- Number of partitions of n into 6 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=41A244242
- Number of (n+2) X (1+2) 0..2 arrays with every 3 X 3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 or 4.at n=7A252336
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 or 4.at n=28A252343
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 or 4.at n=35A252343
- Number of (n+2)X(1+2) 0..1 arrays with every 3X3 subblock sum of the two maximums of the diagonal and antidiagonal minus the sum of the minimums of the central row and column nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=2A254253