14433
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20448
- Proper Divisor Sum (Aliquot Sum)
- 6015
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9024
- Möbius Function
- -1
- Radical
- 14433
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 71
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = n*(25*n - 1)/2.at n=34A022282
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers).at n=16A024309
- Coefficient of x^(-n) in expansion of continued fraction 0, x, x^2, x^3, x^4, ... .at n=57A049346
- Number of 0..n arrays x(0..3) of 4 elements with nondecreasing average value and 0..n occur with instance counts within one of each other.at n=18A200943
- G.f.: 1/G(0) where G(k) = 1 + (-q)^(k+1) / (1 - (-q)^(k+1)/G(k+1) ).at n=57A227310
- T(n,k)=Number of length n+3 0..k arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=47A249707
- Number of length 3+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms.at n=7A249709
- Composite numbers n such that E(n+1)+1 is divisible by n, where E(n) is the n-th Euler number (A122045).at n=18A287934
- Numbers k such that (8*10^k + 13)/3 is prime.at n=19A294939
- The q-analog T(q; n,k) of the triangle A163626 for 0 <= k <= n, for q = 2.at n=23A308326
- a(n) = (n!)^2 * Sum_{k=0..n} 2^(n-k) / (k!)^2.at n=4A336804
- G.f. A(x) satisfies: A(x) = x * (1 + A(x))^4 / (1 - 3 * A(x)).at n=5A366015
- a(n) = Sum_{k=0..floor(n/2)} binomial(k+2,2) * binomial(k,2*(n-2*k)).at n=22A392252