10641
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
- 4
- Divisor Sum
- 14192
- Proper Divisor Sum (Aliquot Sum)
- 3551
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7092
- Möbius Function
- 1
- Radical
- 10641
- 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
- 55
- 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) = n^3 - floor( n/3 ).at n=22A002901
- Inverse Euler transform of {A001285(0), A001285(1), ...} where A001285(n) is Thue-Morse sequence.at n=46A029878
- 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 68.at n=38A031566
- a()=A037260 and its first [ A037261 ], 2nd [ A037262 ] and 3rd [ A037263 ] differences together include every number at most once and are monotonic and minimal.at n=18A037260
- a(n) = 4*a(n-1) + a(n-2); a(0)=1, a(1)=8.at n=6A048877
- a(n) = A064842(n)/2.at n=39A064843
- Row 7 of the array in A107735.at n=7A107731
- a(n) = 7*n^2 + 14*n + 1.at n=38A131878
- Indices k such that A019326(k)=Phi[k](8) is prime, where Phi is a cyclotomic polynomial.at n=27A138938
- The 3-D toothpick sequence A160160, but using toothpicks of length 4; a(n) is the number of nodes occupied after n steps.at n=37A160430
- Number of binary strings of length n with no substrings equal to 0001 0110 or 1101.at n=15A164481
- Expansion of g.f.: exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^(n-k+1) * x^k] * x^n/n ).at n=7A181080
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,3,2,1,0 for x=0,1,2,3,4.at n=13A197211
- Periods associated with A217611.at n=36A217646
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array.at n=19A219810
- Integers k such that the concatenation of 2^k and k is prime.at n=7A262769
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 645", based on the 5-celled von Neumann neighborhood.at n=19A273316
- Number of integer partitions of n whose length and maximum both divide n.at n=56A326843
- a(n) is the number of strings of length n over the alphabet {a,b,c} with the number of a's divisible by 3, and the number of b's and c's is at most 3.at n=21A340169
- Antidiagonal sums of A344639.at n=7A344640