14647
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14896
- Proper Divisor Sum (Aliquot Sum)
- 249
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14400
- Möbius Function
- 1
- Radical
- 14647
- Omega Function (Ω)
- 2
- 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
- 164
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that the digits of k^2 are exactly the same (albeit in different order) as the digits of (k+1)^2.at n=4A072841
- Numbers n such that sum of cubes of even digits of n equals sum of cubes of odd digits of n.at n=2A076165
- Numbers n which are divisors of the number produced by concatenating (n-5), (n-4), ... (n-1) in that order.at n=1A088870
- G.f.: Product_{j>=1} Product_{i>=1} (1 + x^(i*j)).at n=26A107742
- Number of (w,x,y,z) with all terms in {1,...,n} and w>=average{x,y,z}.at n=13A212089
- a(n) = A277715(n) / 3.at n=59A277716
- Numbers whose Euler totient function is equal to the product of the number of divisors of their k first powers, for some k.at n=30A283759
- Inverse of A282291: if A282291(k) = n, a(n) = k, or 0 if n does not occur in A282291.at n=36A304090
- Sum of the second largest parts of the partitions of n into 10 squarefree parts.at n=47A326636
- Number of different values of (x_n, x_1*x_2*...*x_n) where x_1=1 and x_i-x_{i-1} is 0 or 1.at n=16A334636
- The smallest number such that n or more numbers k exist such that a(n) - k = sopfr(a(n)) + sopfr(k), where sopfr(m) is the sum of the primes dividing m, with repetition.at n=11A369351
- The smallest number such that exactly n numbers k exist such that a(n) - k = sopfr(a(n)) + sopfr(k), where sopfr(m) is the sum of the primes dividing m, with repetition.at n=11A370091