14354
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21534
- Proper Divisor Sum (Aliquot Sum)
- 7180
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7176
- Möbius Function
- 1
- Radical
- 14354
- 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
- 76
- 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
- yes
- Odd
- no
Appears in sequences
- Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1 = s(n), |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-1), where T is the array in A026268.at n=10A026270
- a(n) = 4*n^4 + 24*n^3 + 84*n^2 + 144*n + 98.at n=6A160828
- Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant in the closed interval [-n,n].at n=15A211031
- Number of distinct finite languages over binary alphabet, whose minimum regular expression has reverse Polish length 2n-1.at n=6A211942
- Numbers which are the sums of consecutive fourth powers.at n=41A217844
- Partial sums of A253090.at n=34A255603
- Smallest k such that A285481(k) >= n, i.e., lowest d where the smallest integer radius needed for a d-dimensional ball to have a volume >= 1 is at least n.at n=29A285482
- Array read by antidiagonals: T(m,n) = number of maximal irredundant sets in the grid graph P_m X P_n.at n=47A291439
- Array read by antidiagonals: T(m,n) = number of maximal irredundant sets in the grid graph P_m X P_n.at n=52A291439
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295862
- E.g.f.: exp( exp(x) * (exp(x) - 1 - x - x^2 / 2) ).at n=9A347434
- Number of compositions (ordered partitions) of n into at most 6 prime parts (counting 1 as a prime).at n=38A347761