10461
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15264
- Proper Divisor Sum (Aliquot Sum)
- 4803
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6320
- Möbius Function
- -1
- Radical
- 10461
- 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
- 179
- 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
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=29A025119
- Number of ways to partition n elements into pie slices each with an odd number of elements.at n=25A032189
- Number of cyclic compositions of n into parts >= 2.at n=25A032190
- Number of score sequences in tournament with n players, when 5 points are awarded in each game.at n=5A047731
- Number of primitive (period n) step cyclic shifted sequences using a maximum of three different symbols.at n=12A056420
- Values of k such that floor(k*tanh(Pi)) = floor((k+1) tanh(Pi)).at n=38A096613
- Numbers k such that phi(k) + prime(k) is a triangular number.at n=36A115908
- Number of possible plays on the n-th move in Mirror Chess in which Black's play is always the mirror image of White (White must either mate or play such that Black can mirror the move).at n=3A136257
- Number of n X n binary arrays with all ones connected only in a 01110-11111 pattern in any orientation.at n=7A147360
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 01110-11111 pattern in any orientation.at n=17A147362
- 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, 1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=8A149047
- Number of binary strings of length n with equal numbers of 00100 and 10001 substrings.at n=14A164240
- Number of different canonical trees in game trees obtained from a starting position with n initial points in misere Sprouts.at n=3A164951
- Numbers starting with 1 such that the sum of any two distinct elements has an even number of distinct prime factors.at n=12A180514
- Numbers k such that k^2+1 = 2p,(k+1)^2+1 = 5q, (k+2)^2+1 = 10r where p, q, and r are primes.at n=16A181619
- Number of 3-element nondividing subsets of {1, 2, ..., n}.at n=42A187490
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=25A208181
- Expansion of g.f. (x*(1+x)*(1-x+x^2)*(1+x+x^2)*(1-x^2+x^4))/(1-x^2+x^4-x^5-x^6+x^7-x^9).at n=65A226591
- a(1) = 6; for n > 1, a(n) = the least squarefree composite number whose sum of prime factors is prime and whose greatest prime factor is the sum of prime factors of a(n-1).at n=37A262081
- Number of edges formed by sides and straight "chords" in a right triangle when each side is divided by vertices into n equal segments.at n=7A274586