14661
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 22022
- Proper Divisor Sum (Aliquot Sum)
- 7361
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- 0
- Radical
- 543
- Omega Function (Ω)
- 5
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 11 positive 8th powers.at n=29A003389
- Number of paraffins (see Losanitsch reference for precise definition).at n=17A006010
- Fibonacci sequence beginning 3, 13.at n=16A022124
- T(n,1) + T(n,2) + ... T(n,n), where T is the array in A026098.at n=27A026101
- Number of partitions of n with equal number of even and odd parts.at n=51A045931
- Number of rooted trees with n nodes with every leaf at height 6.at n=19A048811
- a(n) = sum of terms in n-th row of A078448.at n=19A078449
- Expansion of (1+2*x)/((1+x)*(1-x^2-x^3)).at n=36A098601
- a(0)=20, a(1)=9; for n >= 0, a(n+2) = 7*a(n+1) + 9*a(n).at n=4A136010
- Numbers k such that k and k^2 use only the digits 1, 2, 4, 6 and 9.at n=35A136995
- Expansion of g.f.: x*(1 - x)*(1 + x)/(1 - x - 9*x^2 - x^3 + x^4).at n=9A171066
- a(n) = a(n-1) + a(n-2) - [a(n-4)/4] - [a(n-5)/2] - [a(n-6)/4].at n=24A173597
- Number of (n+1)X(n+1) -8..8 symmetric matrices with every 2X2 subblock having sum zero and one or three distinct values.at n=7A211468
- Triangle read by rows: T(n,k) (0 <= k <= n) = numerator of Integral_{x=0..n} binomial(x,k).at n=49A241186
- T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=37A248987
- Number of length 2+4 0..n arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=7A248989
- Zeroless numbers n whose digit product squared is equal to the digit product of n^2.at n=15A256115
- Odd numbers n such that q(n)^2 = q(n^2) != 0, where q(n) is the digit product on base 10.at n=8A278316
- Numbers m such that gcd(s1,s2) = number of the Collatz iterations of m where s1 is the sum of the odd terms and s2 the sum of the even terms in the Collatz trajectory.at n=4A281195
- Squares where knight moving to a lowest unvisited square on a spirally numbered board will have no available moves.at n=12A323714