14663
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16896
- Proper Divisor Sum (Aliquot Sum)
- 2233
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12600
- Möbius Function
- -1
- Radical
- 14663
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 151
- 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
- Molien series for A_10.at n=39A008633
- Number of partitions of n into at most 10 parts.at n=39A008639
- Number of partitions of n into 10 unordered relatively prime parts.at n=39A023030
- Number of partitions of n in which the greatest part is 10.at n=49A026816
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 11.at n=10A031689
- Column 4 of an array closely related to A083480. (Both arrays have shape sequence A083479).at n=10A089574
- a(n) = 121*n^2 + 2*n.at n=10A181679
- a(n) = n*(n^3 + 2).at n=11A185065
- G.f. A(x) satisfies: x = Sum_{n>=0} -(-A(x))^A000069(n), where A000069 is the odious numbers.at n=9A185202
- Quadruples (a,b,c,d) of the form ( n*(n^3-1), n^3-1, 2*n^3+1, n*(n^3+2) ).at n=43A204767
- Numbers such that the sequence of all possible sums of divisors of n is increasing but not strictly so, the sums being ordered by their characteristic functions, seen as binary numbers (see example).at n=10A230492
- Numbers n such that n*A007954(n) contains the same distinct digits as n.at n=16A248039
- Numbers k such that (73*10^k + 143)/9 is prime.at n=21A272193
- Number of partitions of n into 10 distinct and relatively prime parts.at n=39A341914
- Number of partitions of n that contain more prime parts than nonprime parts.at n=41A355225
- a(n) is the difference between the sum of the squares and the sum of the cubes for the n first terms of A002760.at n=46A374754