10943
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11328
- Proper Divisor Sum (Aliquot Sum)
- 385
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- 1
- Radical
- 10943
- 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
- 86
- 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
- a(n) = Fibonacci(n) - 3. Number of total preorders.at n=17A006327
- An "extremely strange sequence": a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=4.001, B=1.2.at n=13A028948
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=0A045156
- Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=10A045277
- Final members of groups in A076105.at n=41A076102
- Number of permutations in S_n avoiding 21{bar 3}54 (i.e., every occurrence of 2154 is contained in an occurrence of a 21354) and such that the graph corresponding to the permutation is connected (see "Forest-like permutations" below).at n=7A117107
- One-seventh of the difference of squares of legs of primitive Pythagorean triangles, neither of which is a multiple of 7.at n=40A127924
- a(n) = n*(n^2 + 3*n + 5)/3.at n=31A145069
- a(n) = 288*n - 1.at n=37A157997
- a(n) = 576*n - 1.at n=18A158372
- a(n) = 76*n^2 - 1.at n=11A158765
- Number of binary strings of length n with no substrings equal to 0001, 0011, or 1010.at n=19A164457
- a(1)=3; for n > 1, a(n) = 1 + a(n-1) + gcd( a(n-1)*(a(n-1)+2), A073829(a(n-1)) ).at n=27A167053
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=17A245208
- Decimal representation of the n-th iteration of the "Rule 69" elementary cellular automaton starting with a single ON (black) cell.at n=7A266842
- a(n) = (Fibonacci(n+2)-1) mod Fibonacci(floor(n/2)).at n=41A270741
- Total number of inversions in all partitions of n into distinct parts.at n=40A271371
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood.at n=13A278446
- Length of n-th iterate of the mapping 00->001, 1->10, as in A284932.at n=19A286938
- G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n * ((1 + 4*x)^n - A(x))^(n+1), where A(0) = 0.at n=5A325584