12669
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 4803
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8160
- Möbius Function
- -1
- Radical
- 12669
- 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
- 169
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into parts 3k or 3k+1.at n=50A035360
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048225.at n=24A048235
- Expansion of exp(exp(x)-1)/(2-exp(x)).at n=6A059099
- Smallest magic constant for any n X n magic square made from consecutive primes, or 0 if no such magic square exists.at n=14A073520
- Numbers k such that the decimal expansion of Pi^k begins (after the decimal point) with k.at n=4A100323
- Poincaré series [or Poincare series] P(C_{3,2}(0); t).at n=28A124636
- 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), (0, 0, 1), (0, 1, 0), (1, 0, 0), (1, 1, -1)}.at n=7A151062
- Total number of smallest parts in all partitions of n that do not contain 1 as a part.at n=37A195820
- Number of n X 2 nonnegative integer arrays with upper left 0 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down.at n=18A252932
- Smallest magic sum for any n X n semimagic square made from consecutive primes, or 0 if no such magic square exists.at n=14A270829
- a(n) = PrimePi(n^3) - PrimePi(n)^3, where PrimePi = A000720.at n=56A291538
- Number of nX4 0..1 arrays with every element equal to 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A300111
- Number of nX7 0..1 arrays with every element equal to 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A300114
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=48A300115
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=51A300115
- Number of n X 3 0..1 arrays with every element unequal to 0, 1, 3 or 8 king-move adjacent elements, with upper left element zero.at n=15A304216
- Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=4A306197
- Numbers k such that 323*2^k+1 is prime.at n=9A322954
- Number of rectangular plane partitions of n with strictly decreasing rows and columns.at n=42A323430
- Number of parts in all thrice partitions of n into distinct parts.at n=13A327628