12124
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24304
- Proper Divisor Sum (Aliquot Sum)
- 12180
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 6062
- Omega Function (Ω)
- 4
- 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
- 143
- 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 solutions to the equation phi(x) = n!.at n=10A055506
- Numbers k such that k^14 == 1 (mod 15^3).at n=14A056087
- Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly four ways.at n=6A076457
- Number of monotone n-weightings of complete bipartite digraph K(4,2).at n=6A085464
- Even pseudoprimes to base 9.at n=21A090083
- a(n) = 3 + 7*a(n-2) + sqrt(1 + 48*a(n-2) + 48*a(n-2)^2), with a(1) = 0, a(2) = 0, a(3) = 2.at n=9A103625
- Integer part of square root of n^5 = A000584(n).at n=42A155013
- Triangle read by rows: row n gives coefficients of expansion of polynomial p(k,n) in powers of k, defined by p(k, 0) = 1, p(k, 1) = 1+2*k; for n>1, p(k,n) = If[Mod[n, 2] == 0, (1 + 2*k)*p(k, n - 1) + n*Binomial[n + 1, n - 1]*k*(k + 1)*p(k, n - 2), (1 + 2*k)*(1 + 3*(p(k, n - 1) - 1))].at n=23A167883
- Number of strictly increasing arrangements of n nonzero numbers in -(n+2)..(n+2) with sum zero.at n=8A188117
- 1-sequence of reduction of (3n-2) by x^2 -> x+1.at n=12A192312
- a(n) = Sum_{i=0..n} digsum_8(i)^3, where digsum_8(i) = A053829(i).at n=42A231682
- Number of length n+5 0..3 arrays with some disjoint triples in each consecutive six terms having the same sum.at n=3A248063
- T(n,k)=Number of length n+5 0..k arrays with some disjoint triples in each consecutive six terms having the same sum.at n=18A248068
- Number of length 4+5 0..n arrays with some disjoint triples in each consecutive six terms having the same sum.at n=2A248072
- a(n) = n*(n^2 + 3*n - 2)/2.at n=28A256857
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 267", based on the 5-celled von Neumann neighborhood.at n=26A271085
- 34-gonal numbers: a(n) = n*(32*n-30)/2.at n=28A282854
- Partial sums of A299896.at n=29A299897
- Pseudoprimes to base 9 that are not squarefree.at n=21A306448
- Sum of the prime parts in the partitions of n into 7 parts.at n=32A309468