14545
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17460
- Proper Divisor Sum (Aliquot Sum)
- 2915
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11632
- Möbius Function
- 1
- Radical
- 14545
- 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
- 133
- 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
- no
- Odd
- yes
Appears in sequences
- Tennis ball problem: Balls 1 and 2 are thrown into a room; you throw one on lawn; then balls 3 and 4 are thrown in and you throw any of the 3 balls onto the lawn; then balls 5 and 6 are thrown in and you throw one of the 4 balls onto the lawn; after n turns, consider all possible collections on lawn and add all the values.at n=6A031970
- a(d-2) is the smallest member of A046076 containing an undulating sequence of 010... or 101... of maximal length d=3, 4, ...at n=6A046077
- Whitney number of level n of the lattice of the ideals of the fence of order 2n.at n=12A051286
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an acute integer triangle with integer area.at n=27A070146
- Largest Whitney number of Fibonacci lattices J(Z_n).at n=24A077419
- Where A093316 first equals n.at n=20A093319
- a(n) is the smallest semiprime such that difference between a(n) and next semiprime, b(n), is n.at n=20A131109
- a(n) = least member of A006881 whose difference from the following one equals n, or 0 if no such semiprime exists.at n=20A140784
- Triangle of binomial sums read by rows: T(n,k) = sum(C(2n-2k-i,i) * C(2k-i,i), i=0..min(k,n-k)).at n=84A172991
- Binomial sums a(n) = Sum_{k=0..n} (binomial(2n-k,k))^2.at n=6A188648
- A triangle formed like generalized Pascal's triangle. The rule is T(n,k) = 2*T(n-1,k-1) + T(n-1,k), the left border is n and the right border is n^2 instead of 1.at n=62A228576
- Number of (n+1) X (7+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=9A259221
- a(n) is the smallest semiprime followed by gap (to the next semiprime) equal to n-th semiprime.at n=6A278349
- Semiprime numbers whose digit string can be partitioned into three parts such that the product of the first two parts equals the third part.at n=31A280636
- Number of indecomposable permutations avoiding the pattern 1234.at n=7A284719
- Triangle read by rows: T(n,k) is the number of non-intersecting loops starting at (0,0) on the n X k torus consisting of steps up and to the right, 1 <= k <= n.at n=19A324604
- Regular triangle read by rows: T(n,k) is the number of (n,k)-Duck words, for n>=1 and 0<=k<=n-1.at n=22A338403
- Array read by antidiagonals: T(n,k) is the number of length n necklaces using at most k colors with black beads always occurring in runs of even length.at n=72A369524