14233
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14608
- Proper Divisor Sum (Aliquot Sum)
- 375
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13860
- Möbius Function
- 1
- Radical
- 14233
- 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
- 58
- 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
- Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).at n=43A003600
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(2*n-7)*(2*n^2-11*n+18).at n=25A030434
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(2*n - 3)*(2*n^2 - 3*n + 4).at n=23A030441
- Expansion of sum ( q^n / product( 1-q^k, k=1..5*n), n=0..inf ).at n=29A035297
- Least number that ends an arithmetic progression of n numbers with the same prime signature.at n=14A087309
- Least number that ends an arithmetic progression of n numbers with the same number of divisors.at n=14A090548
- Smallest semiprime (A001358) which is at the end of an arithmetic progression of n semiprimes.at n=14A096003
- Number of base 11 circular n-digit numbers with adjacent digits differing by 2 or less.at n=6A124857
- Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array C(t,r) read by rows.at n=39A177020
- Smallest a(n) such that the prime factorization of a(n)! contains at least one factor to each exponent between 1 and n.at n=45A177442
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 549", based on the 5-celled von Neumann neighborhood.at n=23A272844
- Expansion of Sum_{p prime, i>=1} x^(p^i)/(1 - x^(p^i)) / Product_{p prime, j>=1} (1 - x^(p^j)).at n=38A281616
- a(n) = -1 + 5*n/6 + n^3/6.at n=44A283551
- Absolute value of product of nonzero eigenvalues of upper left (n+1)X(n+1) rank 2 submatrix of Wythoff array.at n=15A300158
- a(n) = n * Sum_{d|n} binomial(d+2,3)/d.at n=42A343544
- a(n) is the numerator of Sum_{k=1..n} 1 / (k*k!).at n=5A353545
- Squarefree semiprimes k such that k+1 is the product of three distinct primes and k+2 is the product of four distinct primes.at n=12A376352