12712
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27360
- Proper Divisor Sum (Aliquot Sum)
- 14648
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5424
- Möbius Function
- 0
- Radical
- 3178
- 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
- 32
- 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 series-reduced planted planar trees with n leaves of 2 colors where any 2 subtrees extending from the same node are different.at n=6A032030
- Open 3-dimensional ball numbers (version 4): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (1/2, 1/2, 1/2).at n=29A053596
- Sums of groups in A075643.at n=26A075645
- (n / product of digits of n) is a semiprime.at n=30A085773
- Theorems from propositional calculus, translated into decimal digits.at n=14A101273
- Number of ways to split 1, 2, 3, ..., tn into n arithmetic progressions each with t terms, t>n.at n=12A104442
- Number of permutations of [n] with 3 cycle lengths.at n=2A133119
- T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and without fixed points.at n=39A144089
- a(n) = (p(n)*p(n+1)-p(n+2))/2, where p(n) is the n-th odd prime.at n=35A152527
- Triangle read by rows: T(n,k) is the number of non-derangement permutations of {1,2,...,n} having genus k (see first comment for definition of genus).at n=30A178517
- Number of (n+1) X 2 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=2A205937
- Number of (n+1) X 4 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=0A205939
- T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=3A205944
- T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=5A205944
- Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=7A207489
- Sophie Germain 5-almost primes.at n=20A211162
- Triangular array read by rows: T(n,k) is the number of n-permutations that have exactly k distinct cycle lengths.at n=16A218868
- a(n) = number of triangles that can be formed from the points of a 3 X n grid.at n=14A262402
- Number of regions in a regular drawing of the complete bipartite graph K_{n,n}.at n=16A290131
- a(n) is the least term in A007602 such that the product of digits equals A342950(n) or 0 if no such number exists.at n=18A342952