14026
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21042
- Proper Divisor Sum (Aliquot Sum)
- 7016
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7012
- Möbius Function
- 1
- Radical
- 14026
- 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
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 29.at n=39A020368
- Numbers k such that 169*2^k+1 is prime.at n=19A032461
- McKay-Thompson series of class 28a for Monster.at n=32A058610
- Numbers k such that k*2^m+1 are composites for all exponents m in the range 0<=m<=k.at n=29A061153
- Number of (binary) bit strings of length n in which no even block of 0's is followed by an odd block of 1's.at n=15A065455
- Integers i > 1 for which there is no prime p such that i is a solution mod p of x^4 = 2.at n=25A065903
- Square chains: the number of permutations (reversals not counted as different) of the numbers 1 to n such that the sum of any two consecutive numbers is a square.at n=22A071983
- Finite sum involving signless Stirling numbers of the first kind and the Bell numbers. Appears in the process of normal ordering of n-th power of (a)^2*(a+*a), where a+ and a are boson creation and annihilation operators, respectively.at n=5A121629
- Number of nondecreasing strings of numbers x(i=1..n) in -6..6 with sum x(i)^3 equal to 0.at n=14A188274
- Number of simple connected graphs g on n nodes with |Aut(g)| = 16.at n=9A241461
- Number of n-node rooted identity trees with thinning limbs and root outdegree (branching factor) 4.at n=12A245123
- a(n) = 25*n*(n + 1)/2 + 1.at n=33A262221
- Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 1,0 1,1 0,-1 or -1,1.at n=9A264564
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 643", based on the 5-celled von Neumann neighborhood.at n=21A273314
- Number of irredundant sets in the n-web graph.at n=5A290591
- Number of nX3 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=7A296391
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=47A296396
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 or 3 neighboring 1s.at n=52A296396
- Numbers that are the sum of three positive fifth powers in exactly one way.at n=49A344641
- Expansion of 1 / (1 + Sum_{k>=1} lambda(k)*x^k), where lambda() is the Liouville function (A008836).at n=25A356907