14426
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21642
- Proper Divisor Sum (Aliquot Sum)
- 7216
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7212
- Möbius Function
- 1
- Radical
- 14426
- 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
- 45
- 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
- Number of rooted identity trees with n nodes (rooted trees whose automorphism group is the identity group).at n=16A004111
- a(n) = floor(phi*a(n-2)) + a(n-1) where phi is the golden ratio.at n=16A005834
- Numbers k such that the continued fraction for sqrt(k) has period 49.at n=18A020388
- An approximation to sigma_{5/2}(n): floor( sum_{d|n} d^(5/2) ).at n=41A058272
- An approximation to sigma_{5/2}(n): round( sum_{d|n} d^(5/2) ).at n=41A058273
- McKay-Thompson series of class 21C for the Monster group.at n=23A058565
- a(n) = floor(e*(n+3)!) - (n+3)*(n+2)*(n+1)*n*floor(e*(n-1)!).at n=21A080770
- G.f. satisfies A(x) = 1 + x*A(x*A(x*A(x))).at n=9A087959
- a(n) = n^3 - 2*n^2 + 2*n + 1.at n=24A188947
- Triangular array read by rows: T(n,k) is the number of rooted identity trees with n nodes having exactly k subtrees from the root.at n=47A227774
- a(n) = Sum_{i=0..n} digsum_8(i)^4, where digsum_8(i) = A053829(i).at n=19A231683
- Number of strict partitions of 2n having an ordering of the parts in which no two neighboring parts have the same parity.at n=35A239882
- a(n) = |Gamma(n, i)|^2, where i = sqrt(-1).at n=5A277436
- Number of rooted identity trees with 2n nodes.at n=8A299098