14245
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 7643
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- 1
- Radical
- 14245
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=34A023862
- Numbers k such that 293*2^k + 1 is prime.at n=8A053363
- Engel expansion of gamma^2, (gamma is the Euler-Mascheroni constant A001620) = 0.333178.at n=16A059190
- a(n) = 11*n^2 + 22*n.at n=34A067705
- a(n) = n*(n+2)*(n-2)/3.at n=33A077415
- a(n) = (prime(n)^4 - 1) / 240.at n=10A089034
- a(n) = J_4(n)/240.at n=37A115002
- a(n) = (Product_{i=1..6} n^i+i) / 6!.at n=2A131676
- a(n) = core(A143176(n)).at n=36A144362
- 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, -1, -1), (-1, 0, 0), (0, -1, 0), (0, 0, -1), (1, 1, 1)}.at n=8A149590
- 7 times pentagonal numbers: a(n) = 7*n*(3*n-1)/2.at n=37A152744
- Sum of proper divisors minus the number of proper divisors of n!.at n=7A153825
- Let k=2; then T(n,m) = (((2*k+1)/(m+k+1))*binomial(n-1-k, m-k)*binomial(n+k, m+k) + ((2*k+1)/(n-m+k))*binomial(n-1-k, n-m-1-k)*binomial(n+k, n-m-1+k)), irregular triangle.at n=45A156716
- Let k=2; then T(n,m) = (((2*k+1)/(m+k+1))*binomial(n-1-k, m-k)*binomial(n+k, m+k) + ((2*k+1)/(n-m+k))*binomial(n-1-k, n-m-1-k)*binomial(n+k, n-m-1+k)), irregular triangle.at n=48A156716
- a(n) = index of second occurrence of A161926(n) in A114381.at n=8A161927
- a(n) = (2*n+1)*(2*n+3)*(2*n+5)/3.at n=16A162540
- G.f.: A(x) = Sum_{n>=0} x^n * (1+x)^A038722(n), where A038722(n) = floor(sqrt(2*n)+1/2)^2 - n + 1.at n=19A192316
- Wiener index of a benzenoid consisting of a chain of n hexagons characterized by the encoding s = 1133 (see the Gutman et al. reference, Sec. 5).at n=13A193399
- Number of 0..2 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=9A200865
- a(n) = smallest k having at least four prime divisors d such that (d + n) | (k + n).at n=10A202159