14058
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 33696
- Proper Divisor Sum (Aliquot Sum)
- 19638
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4200
- Möbius Function
- 0
- Radical
- 4686
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- yes
- 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) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=35A002125
- Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=14A071393
- Expansion of g.f. (1 - 3*x + x^2 - sqrt(1 - 6*x + 7*x^2 - 2*x^3 + x^4))/(2*x).at n=9A078482
- a(1) = 1, a(2) = 2, then the absolute difference of the concatenation of two previous terms and its digit reversal.at n=5A085928
- Triangle related to Bell numbers; T(n,k) read by rows, n>=0, 0<=k<=n: T(n,k) = k*T(n-1,k) + Sum(0<=j, T(n-1,k-1+j)); T(0,0)=1, T(0,k)=0 if k>0.at n=39A086211
- Number of partitions of n having no parts with multiplicity 3.at n=37A118807
- G.f. A(x) satisfies A(x/A(x)^4) = 1/(1-x).at n=5A145162
- Numbers k such that (10^k-1)*120/99 + 1 is prime.at n=9A153328
- Number of permutations of 1..n with displacements restricted to {-4,-2,0,1,3}.at n=13A189583
- Triangle T(n,k), read by rows, given by (2, 1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.at n=38A202396
- Total sum of the numbers of partitions with positive k-th ranks of all partitions of n.at n=26A208479
- Largest number k such that phi(k) = A007374(n).at n=34A224532
- Number of partitions of n such that (number of distinct parts) = m(1) - m(2), where m = multiplicity.at n=53A240055
- Number of partitions p of n such that (number of numbers in p of form 3k) = (number of numbers in p of form 3k+1).at n=42A241744
- Number of length 5 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=7A258636
- a(n) is the number of cyclic permutations with at most two descents.at n=11A303117
- a(n) is the number of cyclic permutations with at most 2 ascents.at n=11A304200
- a(n) = Product_{d|n, d<n} prime(1+A003415(d)), where A003415(d) gives arithmetic derivative of d.at n=67A319356
- Numbers that occur in range of A324580.at n=39A324541
- Ordered perimeters p of primitive Pythagorean triangles no side of which is squarefree.at n=26A329392