10941
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16704
- Proper Divisor Sum (Aliquot Sum)
- 5763
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- -1
- Radical
- 10941
- 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
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=21A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=21A004948
- a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=29A050071
- Numbers n such that 87*2^n-1 is prime.at n=33A050569
- Riordan array (1/(1-3x),x(1-x)/(1-3x)^2).at n=31A114195
- Number of partitions of {1,...,n} into blocks such that no even sized block is repeated.at n=9A115277
- Number of partitions of n such that number of odd parts is greater than or equal to number of even parts.at n=35A130780
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (1, -1, 0), (1, -1, 1), (1, 1, 0)}.at n=8A149540
- 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=26A167053
- a(n) = Fibonacci(n) - 5.at n=16A167616
- Number of arrangements of 4 numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=16A188359
- Ordered differences of odd-indexed Fibonacci numbers.at n=47A205371
- s(k)-s(j), where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number.at n=22A205864
- The number of P-positions in the game of Nim with up to four piles, allowing for piles of zero, such that the total number of objects in all piles doesn't exceed 2n.at n=29A237686
- Beastly reciprocals, or numbers k such that digitsum(1/k) = 666.at n=24A244661
- Numbers k such that 7*R_k - 50 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=16A256726
- Expansion of Product_{k>=1} 1/(1 - x^k)^(k^2*(k+1)^2/4).at n=7A287090
- Number of series-reduced free pure identity multifunctions (with empty expressions allowed) with one atom and n positions.at n=13A317881
- Indices n of Gram points g(n) for successive positive maxima of the Riemann zeta function on critical line.at n=31A327543
- Denominators of convergents to 2 Pi + Dottie number (A332506).at n=10A332524