10841
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11172
- Proper Divisor Sum (Aliquot Sum)
- 331
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10512
- Möbius Function
- 1
- Radical
- 10841
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- (n,3,2) difference families over Z_n.at n=20A011992
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=32A045104
- Composite numbers not divisible by 5 which in base 5 contain their largest proper factor as a substring.at n=4A063889
- Canonically 2-indecomposable posets with n antichains.at n=26A072407
- Number of compositions of n into twin primes (i.e., primes that are members of a twin prime pair, like 3, 5, 7, 11, 13, but not 2 or 23).at n=42A077608
- a(n) = a(n-2) + a(n-4) + a(n-5) + a(n-7) + a(n-8) + a(n-10) for n >= 10, with a(0) = ... = a(9) = 1.at n=31A122762
- a(n) = n*(8*n - 3).at n=37A139273
- Solutions a(n) of (a(n)-5)*(a(n)-6) = 21*b(n)*(b(n)-1).at n=7A180509
- Numbers k such that tau(k-1) = (tau(k))^2 = tau(k+1), where tau(k) = A000005(k) (number of divisors of k).at n=37A190266
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^4>x^4+y^4.at n=33A211653
- a(0) = 0; a(n+1) = 2*a(n) + k where k = 0 if prime(n+2)/prime(n+1) > prime(n+1)/prime(n), otherwise k = 1.at n=15A215411
- Expansion of g.f. 1/ (1-x^1*(1-x^(m+1))/ (1-x^2*(1-x^(m+2))/ (1- ... ))) for m=9.at n=19A228645
- Semiprimes whose prime factors differ from each other in one bit position only.at n=42A261077
- Semiprimes p*q such that q = p + 2^k for some k >= 0.at n=59A261078
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 289", based on the 5-celled von Neumann neighborhood.at n=25A271127
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 585", based on the 5-celled von Neumann neighborhood.at n=22A273075
- Numbers k such that (10^k - 97)/3 is prime.at n=18A293757
- a(n) = a(n-1) + a(n-2) + a([(n-1)/2]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=19A298352
- Number of double-crossing set partitions of {1,...,n}.at n=10A306558
- Numbers k such that q = 2^k - 2^m + 1 is prime, where m = A270096(k).at n=57A307625