14022
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32760
- Proper Divisor Sum (Aliquot Sum)
- 18738
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 4674
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = Sum_{k=0..floor(n/2)} A026626(n, k).at n=14A026634
- n times the coefficient of x^n in log[1 + sum(k>=0, x^2^k)].at n=49A092462
- Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1) for k >= 1.at n=47A126954
- Multiples of 19 whose digit reversal - 1 is also a multiple of 19.at n=33A166399
- Sum of binary digits of all primes < 2^n, i.e., with at most n binary digits.at n=13A168155
- a(n) = n*(17*n - 13)/2.at n=41A180232
- Number of nonisomorphic Knuthian systems of order n^2.at n=4A193623
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=32A228963
- Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=17A270446
- Number of convex hulls of vertices of a regular n-gon which include the centroid, up to dihedral symmetry.at n=18A291857
- Number of integer-sided polygons having perimeter n, modulo rotations and reflections.at n=16A293818
- Number of nX6 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=3A302320
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=39A302322
- Number of 4Xn 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302325
- Least number k such that the determinant of the circulant matrix formed by its decimal digits is equal to k/n.at n=37A323485
- Number of prime parts, counted without multiplicity, in all compositions of n.at n=14A336632
- Möbius transform of A341529, sigma(n) * A003961(n).at n=39A347125
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=41A353365