14738
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 22110
- Proper Divisor Sum (Aliquot Sum)
- 7372
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7368
- Möbius Function
- 1
- Radical
- 14738
- 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
- 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
- a(n) = (5*n + 1)^2 + 4*n + 1.at n=24A007533
- Numbers k such that the continued fraction for sqrt(k) has period 3.at n=35A013643
- Starting from generation 8 add previous and next term yielding generation 9.at n=16A048455
- A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).at n=7A080299
- Sums of two or more distinct 4th powers of primes.at n=13A130833
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 01110-11111 pattern in any orientation.at n=15A147366
- a(n) = 25*n^2 - 36*n + 13.at n=25A154355
- (A178476(n)-3)/9.at n=28A178486
- A014486-codes for the Beanstalk-tree growing one natural number at time, starting from the tree of one internal node (1), with the "lesser numbers to the right side" construction.at n=6A218778
- Number of partitions p of n such that (maximal multiplicity over the parts of p) = number of 1s in p.at n=38A241131
- Expansion of Product_{k>=1} 1/(1 - (5*k-4)*x^(5*k-4)).at n=32A265834
- Numbers missing from A001032 despite satisfying the necessary congruence conditions (see comments).at n=36A274469
- Solution (a(n)) of the complementary equation in Comments.at n=11A298741
- Number of normal generalized Young tableaux of size n with all rows and columns strictly increasing.at n=9A299968
- Expansion of Product_{r = 1 or not a perfect power} 1/(1 - x^r).at n=42A305630
- Number of pairwise coprime strict compositions of n, where a singleton is not considered coprime unless it is (1).at n=44A337561
- Sum of the prime numbers appearing along the border of an n X n square array whose elements are the numbers from 1..n^2, listed in increasing order by rows.at n=42A344846
- a(n) = 3*n^3 - 1.at n=17A345701
- Number of numbers with sum of digits n in fractional base 4/3.at n=46A364780
- Irregular triangle read by rows: T(n,k) is the number of compositions of n such that the maximal cardinality of C is k, where C is a subset of the set of parts such that all elements in C appear in weakly increasing order within the composition.at n=63A386891