12069
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 18150
- Proper Divisor Sum (Aliquot Sum)
- 6081
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7992
- Möbius Function
- 0
- Radical
- 447
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- no
- Odd
- yes
Appears in sequences
- a(n) = T(2*n, n-1), where T is given by A026552.at n=7A026559
- 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, 0), (-1, 1, 0), (-1, 1, 1), (1, 0, 0), (1, 1, -1)}.at n=9A148661
- G.f.: Sum_{n>=0} n! * x^(n*(n+1)/2) / Product_{k=1..n} (1 - k*x^k).at n=19A204858
- Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=10A207165
- Number of subsets of {1,...,n} not containing {a,a+2,a+4} for any a.at n=15A209410
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 6 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=3*floor(n/2), read by rows.at n=48A238550
- Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 8 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=4*floor(n/2), read by rows.at n=34A238557
- Sum of the 2nd smallest parts of all the partitions of n (2nd smallest part is defined to be 0 when the partition does not have at least 2 distinct parts).at n=27A265248
- Convolution of A006068 (inverse of Gray code) with itself: a(n) = Sum_{k=1..n+1} A006068(k) * A006068(1+n-k).at n=37A268721
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 539", based on the 5-celled von Neumann neighborhood.at n=6A272802
- Consider Watanabe's 3-shift tag system {00/1011} applied to the word (100)^n; a(n) = position of the longest word in the orbit, or -1 if the orbit is unbounded.at n=34A292094
- Expansion of 1/(1 - x * theta_4(x)), where theta_4() is the Jacobi theta function.at n=21A307901
- a(n) = Sum_{k=1..n} gcd(k, n)^3.at n=21A343497
- Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, up to rotations and reflections, 0 <= k <= n.at n=42A362258
- G.f. satisfies A(x) = 1/(1-x) + x^4*A(x)^4.at n=15A364591
- a(n) = least positive integer m such that when m*(m+1) is written in base n, it does not contain the digit n-1 and contains every single digit from 0 to n-2 exactly once, or 0 if no such number exists.at n=7A382054