14238
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
- 24
- Divisor Sum
- 35568
- Proper Divisor Sum (Aliquot Sum)
- 21330
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4032
- Möbius Function
- 0
- Radical
- 4746
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = n*(n+1)*(4*n+5)/6.at n=27A016061
- Numbers whose set of base-15 digits is {3,4}.at n=24A032839
- a(n) = prime(n)*prime(n+1) - prime(n).at n=29A037166
- a(0) = 1; a(n) = sum_{k=1 to d(n)} [a(n-k)] where d(n) is number of positive divisors of n.at n=17A055873
- Numbers k that divide A005554(k) (the sum of consecutive Motzkin numbers).at n=35A081741
- Triangle of Schroeder paths counted by number of diagonal steps not preceded by an east step.at n=49A108916
- a(n) = n*(n-1)*(n^3 + 21*n^2 - 4*n + 96)/120.at n=15A124161
- a(n) = A000203(n) * A024916(n).at n=19A143238
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1)}.at n=9A148831
- Number of nonnegative integers with property that their base 6/5 expansion (see A024638) has n digits.at n=46A245399
- Triangle T(n,m) = Sum_{k=0..m} (-1)^(m-k)*binomial(m,k)*binomial(n-m+k-1,m-1)*binomial(2*n-3*m+k-1,n-m), T(n,n)=1.at n=47A271776
- a(n) = 36*n^2 - 8*n - 2 (n >=1).at n=19A304834
- Number of minimal complete rulers of length n.at n=24A325684
- Triangle T(n,m) = C(n-1,n-m)*Sum_{k=1..n} C(2*k-2,k-1)*C(n-m,m-k)/m, m>0, n>0, n>=m.at n=50A337977
- Primitive terms of A108569.at n=17A346277
- a(n) = phi(sigma(n)) * A064989(sigma(n)), where A064989 shifts the prime factorization one step towards lower primes.at n=63A353750
- a(n) = A003958(sigma(n)) * A064989(sigma(n)).at n=63A353792
- E.g.f. satisfies A(x) * log(A(x)) = (exp(x*A(x)) - 1)^2 / 2.at n=7A357088
- Number of integer partitions of n whose run-sums are not weakly decreasing.at n=36A357878
- Least area (doubled) of a triangle enclosing a circle of radius n such that the center of the circle and the vertices of the triangle all have integer coordinates.at n=36A358465