12224
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 24384
- Proper Divisor Sum (Aliquot Sum)
- 12160
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6080
- Möbius Function
- 0
- Radical
- 382
- Omega Function (Ω)
- 7
- 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
- 50
- 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 rooted trees with a forbidden limb of length 6.at n=12A052329
- Expansion of 1/(1 - 2*x^2 - 2*x^3).at n=18A052907
- Numbers m such that 2*m - sigma(m) is a divisor of m and greater than one, where sigma = A000203 is the sum of divisors.at n=11A060326
- Number of subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).at n=37A064803
- Numbers n such that sigma(n) is congruent to n mod phi(n).at n=16A066679
- Geometric mean of digits = 2 and digits are in nondecreasing order.at n=13A069512
- Solutions to k + 2*phi(k) = sigma(k) where phi is A000010 and sigma is A000203.at n=5A076373
- (n / product of digits of n) is a semiprime.at n=28A085773
- Numbers that appear in A076078.at n=23A097210
- a(n) = the number of sets of distinct positive integers with a least common multiple of A025487(n), i.e., A076078(A025487(n)).at n=20A097211
- Numbers m such that A076078(m) = m, where A076078(m) equals the number of sets of distinct positive integers with a least common multiple of m.at n=18A097214
- Numbers m such that A076078(m) = m and bigomega(m) >= 2; or in other words, A097214, excluding powers of 2.at n=4A097215
- Numbers n such that A076078(m)=n for some m, excluding powers of 2.at n=9A097416
- Numbers k divisible by their abundance sigma(k) - 2*k.at n=49A097498
- a(n)=4a(n-1)-4a(n-2)+4a(n-3).at n=9A099214
- a(n) = Sum_{k=0..floor(n/4)} C(n-k,3*k) * 2^(n-3*k).at n=10A099785
- Relates row sums of Pascal's triangle to expansion of cos(x)/exp(x).at n=13A100216
- After the first two terms, each subsequent term is the smallest integer that is an outlier of the previous dataset, based on the criterion of 3 sample standard deviations above the mean.at n=43A103231
- Row sums of correlation triangle for floor((n+3)/3).at n=43A115266
- a(n) = 2*n*(6*n-1).at n=32A126964