14208
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 38760
- Proper Divisor Sum (Aliquot Sum)
- 24552
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 222
- Omega Function (Ω)
- 9
- 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
- 76
- 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
- Glaisher's function V(n).at n=24A002611
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 59.at n=34A031557
- Numbers k such that sigma(x) = k has exactly 8 solutions.at n=36A060664
- Take pairs (x,y) with Sum_{j = x..y} j = concatenation of x and y. Sort pairs on y then x. This sequence gives x of each pair.at n=25A070152
- Maximal number of 1432 patterns in a permutation of 1,2,...,n.at n=30A100354
- a(n) = n*(1 + n^2)*2^n.at n=5A119635
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (2,4,4,...) and super- and subdiagonals (1,1,1,...).at n=40A124575
- Numbers such that the sum of the factorials of the digits of the fourth power is a square.at n=23A126077
- Numbers which can be expressed as the product of numbers made of only twos.at n=41A161140
- Numbers with prime signature {7,1,1}, i.e., of form p^7*q*r with p, q and r distinct primes.at n=16A179696
- Constant term of the reduction (by x^2->x+1) of polynomial p(n,x) identified in Comments.at n=8A192350
- a(n) = 14*n^2 - 4*n.at n=32A195023
- Number of nondecreasing -n..n vectors of length 4 whose dot product with some nonincreasing -n..n vector equals 4.at n=10A226401
- Initial members of abundant quadruplets, i.e., values of k such that (k, k+2, k+4, k+6) are all abundant numbers.at n=25A231089
- Positions of 3's in A234323.at n=25A234804
- Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237539
- Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237541
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A237544
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=5A237544
- a(n) is the smallest number that requires at least n adjacent bit swaps in order to pack all the ones to the right.at n=44A243112