14450
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 28551
- Proper Divisor Sum (Aliquot Sum)
- 14101
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5440
- Möbius Function
- 0
- Radical
- 170
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=66A011901
- Numbers k such that k | 13^k + 1.at n=26A015963
- Numbers that are the sum of 2 nonzero squares in exactly 5 ways.at n=3A025288
- Numbers that are the sum of 2 nonzero squares in 5 or more ways.at n=10A025296
- Number of partitions of n in which no parts are multiples of 5.at n=39A035959
- Numbers k such that k^2 + 1 is composite and phi(k^2 + 1) == 0 (mod k).at n=28A067519
- Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=4A097226
- Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=15A097647
- Numbers k such that 2^(2*k+1) + 2^k + 1 is prime.at n=35A105180
- Composite solutions to the equation reversal(x) - phi(x) = 1.at n=5A130000
- a(n) = 20*a(n-1) - 64*a(n-2) - 150 for n > 2; a(0) = 357, a(1) = 14450, a(2) = 221650.at n=1A166913
- G.f. satisfies: A(x) = A(x^2)^2 + x*A(x^2)^3.at n=34A174512
- Number of 3-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=16A187858
- Unsigned matrix inverse of triangle A214398, as a triangle read by rows n >= 1.at n=32A215241
- The sum of the totatives of n is a perfect cube.at n=27A237282
- Total number of 2 X 2 squares appearing in the Thue-Morse sequence logical matrices after n stages.at n=9A241683
- Total number of 2 X 2 squares appearing in the Thue-Morse sequence logical matrices (1, 0 version) after n stages.at n=9A241892
- Even numbers which are neither primes nor perfect powers and are coprime to the sum of their divisors.at n=43A248023
- Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum 1 3 6 or 8 and every diagonal and antidiagonal sum not 1 3 6 or 8.at n=6A252010
- Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum 1 3 6 or 8 and every diagonal and antidiagonal sum not 1 3 6 or 8.at n=2A252014