12934
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 7226
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6216
- Möbius Function
- -1
- Radical
- 12934
- 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
- yes
- Odd
- no
Appears in sequences
- Truncated octahedral numbers: 16*n^3 - 33*n^2 + 24*n - 6.at n=9A005910
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=36A020435
- T(n,n-1), array T as in A047140.at n=8A047143
- Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=37A157531
- Triangle T(n, k) = binomial(2*n, n) + binomial(n, k)^2, read by rows.at n=43A157531
- Number of permutations of length n which avoid the patterns 4321 and 1324.at n=9A165524
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no element more than one greater than the previous.at n=35A199848
- Number of (5+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=25A250659
- Bernoulli number B_{n} has denominator 354.at n=30A255684
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 158", based on the 5-celled von Neumann neighborhood.at n=32A270335
- Expansion of e.g.f. -log(1 - log(1 + x))/(1 - log(1 + x)).at n=9A302547
- Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A303237
- Numbers k such that the determinant of the Vandermonde matrix of their digits is equal to sigma(k), the sum of divisors of k.at n=3A307586
- a(n)^2 is the start of the first occurrence of n consecutive perfect powers, all of which are squares with exponents equal to 2 (A111245).at n=35A340663
- Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=15A340957
- a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such integer exists.at n=40A350207