14021
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16032
- Proper Divisor Sum (Aliquot Sum)
- 2011
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12012
- Möbius Function
- 1
- Radical
- 14021
- 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
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=14A049936
- Generalized sum of divisors function: third diagonal of A060044.at n=39A060045
- Number of n X n binary arrays with all ones connected only in a 11000-01111-11000 pattern in any orientation.at n=8A147452
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 11000-01111-11000 pattern in any orientation.at n=19A147454
- 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, 0), (-1, 0, 0), (0, 1, 0), (1, -1, -1), (1, 0, 1)}.at n=8A150008
- Number of (w,x,y,z) with all terms in {0,...,n} and 2w=max{w,x,y,z}-min{w,x,y,z}.at n=31A212757
- Number of third differences of arrays of length 5 of numbers in 0..n.at n=19A228261
- Let f(x) = 1 -x^3+ Sum_{j>=2} (x^(2^j)-x^(1+2^j)). Then a(n) is n times the coefficient of x^n in the expansion of log(f(x)).at n=48A271726
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=22A274234
- Numbers k such that (101*10^k - 17)/3 is prime.at n=22A276114
- Replacing each digit d in decimal expansion of n with d^2 yields a prime at each step when done recursively three times.at n=17A316604
- Numbers k such that both k and k+2 are de Polignac numbers (A006285).at n=17A330284
- Expansion of g.f. (x^4*(x^2 + 2*x + 3))/((x - 1)^4*(x + 1)*(x^2 + x + 1)).at n=45A349975
- Number of integer partitions with sum < n whose distinct parts cannot be linearly combined using all positive coefficients to obtain n.at n=49A365323
- Number of integer partitions of n with all distinct lengths of maximal gapless runs (decreasing by 0 or 1).at n=38A384884