12368
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 23994
- Proper Divisor Sum (Aliquot Sum)
- 11626
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6176
- Möbius Function
- 0
- Radical
- 1546
- 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
- 125
- 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 commutative elements in Coxeter group H_n.at n=7A013981
- Trajectory of 1 under map n->43n+1 if n odd, n->n/2 if n even.at n=25A033977
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 4).at n=56A046767
- Minimum number of identical bricks of length 1 which, when stacked without mortar in the naive way, form a stack of length >=n.at n=5A065071
- Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis (i.e., d or u steps hitting the x-axis).at n=46A109193
- Number of irreducible Boolean polynomials of degree n.at n=15A169912
- Triangle T(n,k) read by rows: number of LCO forests of size n with k leaves, 1 <= k <= n.at n=57A175136
- Array read by antidiagonals: T(n,k) = number of n-step knight's tours on a (k+2)X(k+2) board summed over all starting positions.at n=48A186851
- Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=6A186853
- Expansion of (1-x)*(10*x^4-20*x^3+16*x^2-6*x+1)/(1-2*x)^5.at n=8A190051
- Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and the average of every three consecutive elements is never greater than the median of the previous three elements.at n=23A263732
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of chambers (or regions) formed by drawing the line segments connecting any two of the (n+1) X (m+1) lattice points in an n X m lattice polygon.at n=14A288187
- a(n) = 96*2^n + 80.at n=7A305062
- a(n) is the least positive integer that has exactly n anagrams that are semiprimes, or -1 if there is no such integer.at n=34A362499