10418
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15630
- Proper Divisor Sum (Aliquot Sum)
- 5212
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5208
- Möbius Function
- 1
- Radical
- 10418
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- yes
- Odd
- no
Appears in sequences
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k returns to the x-axis (1 <= k <= n).at n=48A128741
- A129957(n) - n*(n-1)/2.at n=22A129959
- Numerator of Sum_{k=1..n} H(k)*H(n+1-k), where H(k) is the k-th harmonic number (Sum_{j=1..k} 1/j).at n=9A130894
- This sequence and A139143 are complements. a(1) = 1, A139143(1) = 2, a(n+1) = a(n) + Sum_{k = 1..n} A139143(k).at n=36A139142
- List of different composites in Pascal-like triangles with index of asymmetry y = 3 and index of obliqueness z = 0 or z = 1.at n=26A141069
- a(0)=2, a(n) = n^2+a(n-1).at n=31A153056
- a(n) = A056520(n)+1 for n>0, a(0)=1.at n=31A179904
- Number of partitions p of n such that (number of even numbers in p) > (number of odd numbers in p).at n=40A241640
- Lengths of runs of identical terms in A253443.at n=37A253444
- Least positive integer k such that prime(k*n) - 1 = (prime(i*n)-1)*(prime(j*n)-1) for some integers 0 < i < j < k.at n=38A257938
- Number of trapezoidal words of length n.at n=40A260881
- Positions of 2's in A264977; positions of 3's in A277330.at n=41A277712
- Number of rooted trees with n nodes such that seven equals the maximal number of subtrees of the same size extending from the same node.at n=11A318822
- Number of rooted trees with n nodes such that seven equals the maximal number of isomorphic subtrees extending from the same node.at n=11A318864
- Number of n-node rooted trees in which nine equals the maximal number of nodes in paths starting at a leaf and ending at the first branching node or at the root.at n=10A318905
- Number of plane trees with n nodes where the sequence of branches directly under any given node is a chain of multisets.at n=13A319379
- a(n) = 1 + Sum_{k=2..n} (-1)^k * k^2 * a(floor(n/k)).at n=33A361983
- Numbers k such that A380459(k) has no divisors of the form p^p, while A003415(k) has such a divisor or is 0.at n=39A380474