14649
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20640
- Proper Divisor Sum (Aliquot Sum)
- 5991
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9216
- Möbius Function
- -1
- Radical
- 14649
- 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
- 102
- 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
- a(n) is least k such that k and 9k are anagrams in base n (written in base 10).at n=10A023101
- Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,1,0.at n=6A037793
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=34A039848
- Meandric numbers for a river crossing two parallel roads at n points.at n=12A076876
- Riordan array (1/sqrt(1-4*x), (1/sqrt(1-4*x)-1)/2).at n=39A116395
- Number of circular n-letter words over the alphabet {0,1,2,3,4} with adjacent letters differing by at most 2.at n=7A124806
- Number of kites, distinct up to congruence, on an n X n grid (or geoboard).at n=34A181946
- Total number of 231 patterns in the set of permutations avoiding 123.at n=7A210064
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2<x^2+y^2.at n=27A211635
- Array read by antidiagonals: T(m,n) = number of m-ary words of length n with cyclically adjacent elements differing by 2 or less.at n=47A285280
- Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.at n=24A340757
- a(1) = 4; for n > 1, a(n) = 5*a(n-1) + 5 - n.at n=5A353096
- Array read by ascending antidiagonals: A(1, k) = k; for n > 1, A(n, k) = (k + 1)*A(n-1, k) + k + 1 - n, with k > 0.at n=39A363365
- Number of compositions of n where there are A005809(k) sorts of part k.at n=5A370375
- Number of distinct sums i^3 + j^3 + k^3 for 0<=i<=j<=k<=n.at n=44A374710
- G.f. A(x) satisfies A(x) = ( 1 + x*A(x)^(2/3)/(1 - x*A(x)^(4/3)) )^3.at n=6A378828
- Number of integer partitions of n such that the product of parts is greater than the sum of primes indexed by the parts.at n=35A380411