10441
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10692
- Proper Divisor Sum (Aliquot Sum)
- 251
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10192
- Möbius Function
- 1
- Radical
- 10441
- 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
- 104
- 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
- Expansion of tan(x)/cosh(x).at n=4A003702
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=40A020413
- a(n) = [ 2nd elementary symmetric function of {sqrt(k)} ], k = 1,2,...,n.at n=34A025193
- a(n) = Sum_{i=0..2} binomial(Fibonacci(n),i).at n=12A032441
- a(n) = n*2^n + 2*n^2 + 1.at n=10A046916
- McKay-Thompson series of class 35A for Monster.at n=40A058640
- a(n) = A061086(n) / n.at n=20A061087
- Centered 24-gonal numbers.at n=29A069190
- a(n) is the coefficient of x^n in x/(1 + Sum_{k>=1} (1/2)*(prime(k+1) - 1)*x^k).at n=44A074142
- Third row of Pascal-(1,4,1) array A081579.at n=29A081587
- Number of partitions of 2*n into minimal numbers.at n=38A099385
- a(n) is the least k such that the remainder when 10^k is divided by k is n.at n=46A127818
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=33A135441
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 8 and 9.at n=33A136867
- Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=19A145290
- Number of ways to place zero or more nonadjacent 1,1 2,0 2,1 3,2 3,3 4,2 4,4 5,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155409
- a(n) = 4*n^4 + 17*n^2 + 4.at n=7A156701
- First differences of A161762.at n=11A162460
- a(n) = 8*n^2 + 2*n + 1.at n=36A188135
- a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2.at n=47A211518