14465
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19008
- Proper Divisor Sum (Aliquot Sum)
- 4543
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10480
- Möbius Function
- -1
- Radical
- 14465
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 164
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 3 and 4 (mod 5).at n=55A035587
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=33A066509
- Products of 3 distinct safe primes.at n=37A157354
- Partial sums of A048995.at n=45A174514
- Partial sums of A000132.at n=23A175360
- a(n) counts anti-chains of size two in "0,1,2" Motzkin trees on n edges.at n=9A178834
- a(n) = 384*n + 257.at n=37A229855
- Number T(n,k) of n X n Tesler matrices of nonnegative integers with element sum n+k; triangle T(n,k), n>=1, 0<=k<=n*(n-1)/2, read by rows.at n=49A259786
- Number of length-n 0..4 arrays with no repeated value differing from the previous repeated value by plus or minus one modulo 4+1.at n=5A269686
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by plus or minus one modulo k+1.at n=41A269690
- Number of length-6 0..n arrays with no repeated value differing from the previous repeated value by plus or minus one modulo n+1.at n=3A269692
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 505", based on the 5-celled von Neumann neighborhood.at n=25A272583
- a(n) = (prime(1+n)*prime(n)) + prime(n) + 1.at n=29A286624
- Solution of the complementary equation a(n) = 4*a(n-2) + b(n-1) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, and (a(n)) and (b(n)) are increasing complementary sequences.at n=12A295063
- Numbers k such that [prime(k), prime(k+1), prime(k+2)] = [1, 2, 3] mod 11.at n=22A302767
- Numbers m such that the proportion of nonsquarefree numbers in the interval [1, m] is greater than the corresponding proportion for all k > m.at n=38A336026
- Odd composite integers m such that A004254(3*m-J(m,21)) == 5*J(m,21) (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol.at n=42A340240
- Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n*(n+1)*(n+2)*(n+3)/24 * x^(4*n) * (1 - x^n)^(n-2).at n=44A357157