12341
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
- 8
- Divisor Sum
- 14784
- Proper Divisor Sum (Aliquot Sum)
- 2443
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- -1
- Radical
- 12341
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- no
- Odd
- yes
Appears in sequences
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=41A000292
- a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=21A000447
- Numerators of approximations to e.at n=24A006258
- Binomial coefficient C(43,n).at n=3A010959
- Binomial coefficient C(n,40).at n=3A010993
- Odd tetrahedral numbers: a(n) = (4*n+1)*(4*n+2)*(4*n+3)/6.at n=10A015219
- a(n) = (prime(n)-3)*(prime(n)-5)*(prime(n)-7)/48.at n=22A030003
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) <= cn(1,5).at n=64A036854
- T(n,3), array T as in A050186; a count of aperiodic binary words.at n=40A050188
- Numerator of n*(n-1)*(n-2)/720.at n=43A051726
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=41A051869
- Number of (3,n)-partitions of a chain of length n^2.at n=7A055658
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to e = exp(1).at n=36A065370
- a(n) = lcm(n, n+1, n+2)/6.at n=40A067046
- a(n) = 7*n^2 + 14*n.at n=40A067727
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=27A070192
- Squarefree tetrahedral numbers.at n=13A070755
- Numbers n such that (i) the largest prime factor of n is not a palindrome and (ii) the sum of the factorials of the digits of n is equal to the largest prime factor of n reversed.at n=11A074301
- Pierce expansion of 1/zeta(2).at n=12A091833
- E.g.f.: exp(x)/(1-x)^4.at n=5A095000