11829
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15776
- Proper Divisor Sum (Aliquot Sum)
- 3947
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7884
- Möbius Function
- 1
- Radical
- 11829
- Omega Function (Ω)
- 2
- 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
- 24
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of matrix bundles of codimension n (Euler transform of A001156).at n=21A007864
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 72.at n=31A031570
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).at n=30A056861
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=42A117725
- Semiprimes s such that s-/+2 are primes.at n=44A125215
- a(n) = 338*n - 1.at n=34A157999
- a(n) = 70*n^2 - 1.at n=12A158736
- Numbers k that divide the k-th partial sum of all semiprimes.at n=7A173663
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=39A191397
- Odd numbers producing 5 odd numbers in the Collatz iteration.at n=38A198588
- Odd numbers producing 20 even numbers in the Collatz iteration.at n=33A199818
- Number of partitions p of n such that max(p) - 3*min(p) is a part of p.at n=40A238627
- Numbers k such that k!6 + 8 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=16A288152
- Numbers k > 0 such that either 3*k+4, k-2, k+2, n+k or 3*k+5, k-1, k+1, k+5 are all primes.at n=39A290130
- Number of permutations p of [n] such that 0p has a nonincreasing jump sequence beginning with two.at n=15A292168
- Partial sums of A299258.at n=24A299264
- a(n) is the least k such that A353709(k) has Hamming weight n.at n=8A354040
- a(n) = Sum_{k=0..n} binomial(2*n+3*k+1,n-k).at n=6A390268