14418
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 32670
- Proper Divisor Sum (Aliquot Sum)
- 18252
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4752
- Möbius Function
- 0
- Radical
- 534
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=22A074303
- a(n) = |b(n)|^2 = x^2 + 3*y^2 where (x,y,y,y) is the quaternion b(n) of the sequence b of quaternions defined by b(0)=1,b(1)=1, b(n) = b(n-1) + b(n-2)*(0,c,c,c) where c = 1/sqrt(3).at n=14A105309
- Number of (ordered) sequences of coins (each of which has value 1, 5, 10, 25, 50 or 100) which add to n.at n=34A114044
- Multiples of 18 containing a 18 in their decimal representation.at n=36A121038
- Irregular triangle by rows derived from variants of Cartan matrices: 1's in the super and subdiagonals and 3,4,4,4,... in the main diagonal alternating with 4,4,4,...at n=61A180062
- Pascal-like triangle with trigonometric properties, row sums = powers of 4; generated from shifted columns of triangle A180062.at n=50A180063
- Numbers n such that n^8 + 1 and (n + 2)^8 + 1 are both prime.at n=34A217972
- Sum of all parts of all overcompositions of n.at n=8A236626
- Triples of practical numbers: numbers n such that n-2, n, n+2 are all practical numbers.at n=18A287682
- Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi.at n=37A291876
- Number of (undirected) paths in the complete bipartite graph K_{m,n} (triangle read by rows with m = 1..n and n = 1..).at n=38A307027
- Number of length n - 1 ordered set partitions of {1..n} where no element of any block is greater than any element of a non-adjacent consecutive block.at n=15A332724
- G.f.: Sum_{n>=0} x^n/(1 - x*(1+x)^(n+1)).at n=11A340776
- Number of compositions of n into parts of size 1, 5, 10 or 25.at n=34A351724
- a(n) = Sum_{k=0..floor(n/3)} binomial(n-2*k,k) * binomial(2*(n-3*k),n-3*k).at n=8A383581