10438
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16632
- Proper Divisor Sum (Aliquot Sum)
- 6194
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- -1
- Radical
- 10438
- 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
- 55
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n if there are two kinds of 1, two kinds of 2 and two kinds of 3.at n=20A000098
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=36A025000
- Least term in period of continued fraction for sqrt(n) is 6.at n=41A031430
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=40A064026
- Number of partitions of n into Lucas parts (A000032).at n=57A067593
- (2*5^n + 2^n)/3.at n=6A082685
- a(n) = Sum_{k = 0..floor(n/2)} floor(C(n-k,k)/(k+1)).at n=23A095719
- Number of permutations in S_n avoiding {bar 1}5{bar 2}43 (i.e., every occurrence of 543 is contained in an occurrence of 15243).at n=9A137552
- a(n) = 9*n^2 + n.at n=33A154517
- a(n) = 36*n^2 + 2*n.at n=16A158064
- a(n) = 1156*n^2 + 34.at n=3A158731
- Wiener index of the n-pan graph.at n=42A180861
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k 0's in the top row A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=47A181330
- Number of nX7 nonnegative integer arrays each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=2A202548
- T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=38A202549
- T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it).at n=42A202549
- Expansion of 1/(1 - x - x^2 + x^10 - x^12).at n=20A225396
- Number of nX7 0..2 arrays with new values introduced in each row and column in sequential order starting with zero.at n=2A268055
- T(n,k)=Number of nXk 0..2 arrays with new values introduced in each row and column in sequential order starting with zero.at n=38A268056
- T(n,k)=Number of nXk 0..2 arrays with new values introduced in each row and column in sequential order starting with zero.at n=42A268056