14485
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17388
- Proper Divisor Sum (Aliquot Sum)
- 2903
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11584
- Möbius Function
- 1
- Radical
- 14485
- 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
- 71
- 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
- Expansion of Product_{m>=1} (1 + m*q^m)^20.at n=4A022648
- Trajectory of 1 under map n->21n+1 if n odd, n->n/2 if n even.at n=24A033967
- Trajectory of 3 under map n->21*n+1 if n odd, n->n/2 if n even.at n=31A037108
- Molien series for group G_{1,3} of order 2304.at n=15A051461
- Average of four successive primes squared, (prime(n)^2 + prime(n+1)^2 + prime(n+2)^2 + prime(n+3)^2)/4, n>=2.at n=27A075894
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)+1 are twin primes with p(h) = h-th prime.at n=5A129313
- Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k DUU's, where U=(1,1) and D=(1,-1).at n=61A191795
- Triangle read by rows: number of 321-avoiding ordered set partitions of [n] into k blocks, n>=1, 1<=k<=n.at n=32A227159
- Number of partitions p of n such that max(p) - 2*min(p) is a part of p.at n=42A238626
- p-INVERT of the positive integers, where p(S) = 1 - S - 2*S^2.at n=7A290922