12068
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24192
- Proper Divisor Sum (Aliquot Sum)
- 12124
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5160
- Möbius Function
- 0
- Radical
- 6034
- Omega Function (Ω)
- 4
- 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
- 42
- 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
- Number of labeled servers of dimension 7.at n=4A027394
- a(n+1) = Sum_{k=0..floor(2*n/5)} a(k) * a(n-k).at n=17A030037
- Poincaré series [or Poincare series] (or Molien series) for a certain five-fold wreath product P_5.at n=40A091726
- a(n) = Sum_{d|n} rad(d)^(n/d), where rad(d) = A007947(d) is the squarefree kernel of d.at n=23A095001
- Exponents k such that the sum of decimal digits of 2^k is also a power of 2.at n=17A095412
- Number of labeled n-vertex graphs without vertices of degree <=1.at n=6A100743
- Triangle of Schroeder paths counted by number of diagonal steps not preceded by an east step.at n=38A108916
- Numbers k such that (5^p - 3^p)/2 is prime, where p = prime(k).at n=16A123704
- Number of graphs on n labeled nodes with degree at most 3.at n=5A136282
- Triangle T(n, k) = binomial(2*k, k)*binomial(n+k, n-k) + binomial(2*n-k, k)*binomial(2*(n-k), n-k), read by rows.at n=29A156763
- Triangle T(n, k) = binomial(2*k, k)*binomial(n+k, n-k) + binomial(2*n-k, k)*binomial(2*(n-k), n-k), read by rows.at n=34A156763
- a(n) = A160799(n)/4.at n=35A160807
- Number of ways to place 3 nonattacking knights on an n X n cylindrical board.at n=6A172965
- Number of two-sided n-step prudent walks ending on the northeast corner of their box, avoiding more than two consecutive west steps and more than two consecutive south steps.at n=11A178036
- Number of nX2 0..3 arrays with rows and columns in nondecreasing order.at n=4A184122
- Number of nX5 0..3 arrays with rows and columns in nondecreasing order.at n=1A184125
- T(n,k)=Number of nXk 0..3 arrays with rows and columns in nondecreasing order.at n=16A184129
- T(n,k)=Number of nXk 0..3 arrays with rows and columns in nondecreasing order.at n=19A184129
- Number of (n+1)X4 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=3A206005
- Number of (n+1) X 5 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one, and every 2 X 2 determinant nonzero.at n=2A206006