14068
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 24626
- Proper Divisor Sum (Aliquot Sum)
- 10558
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7032
- Möbius Function
- 0
- Radical
- 7034
- Omega Function (Ω)
- 3
- 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
- 151
- 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) = ceiling(n*phi^13), where phi is the golden ratio, A001622.at n=27A004968
- Numbers k such that 175*2^k+1 is prime.at n=23A032464
- Triangle read by rows of numbers b_{n,k}, n >= 2, 1 <= k < n such that (1/(1-q*t))*Product_{n,k} 1/(1 - q^n*t^k)^b_{n,k} = Sum_{i,j>=1} S_{i,j} q^i*t^j where S_{i,j} are entries in the table A008277 (the inverse Euler transformation of the table of Stirling numbers of the second kind).at n=41A112339
- Triangle read by rows of numbers b_{n,k}, n>=1, 1<=k<=n such that Product_{n,k} 1/(1-q^n t^k)^{b_{n,k}} = 1 + Sum_{i,j>=1} S_{i,j} q^i t^j where S_{i,j} are entries in the table A008277 (the inverse Euler transformation of the table of Stirling numbers of the second kind).at n=50A112340
- a(n) = (n^5 + 145*n^4 + 905*n^3 + 155*n^2 + 594*n + 120)/120.at n=9A143060
- a(n) = 4^n-3^n-2^n-1.at n=7A147975
- Number of (n+2)X4 binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=3A203349
- Number of (n+2)X6 binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=1A203351
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=11A203355
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 010 and 101 in rows, columns and nw-to-se diagonals.at n=13A203355
- Cyclops numbers whose squares are cyclops numbers.at n=19A239827
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 459", based on the 5-celled von Neumann neighborhood.at n=27A272289
- Square array T(n,k) = k^n - Sum_{0 < i < k} e(i)*(k-i)^n where e(i) = 1 if the partial sum up to this term would remain <= k^n, or 0 else; n, k >= 1; read by falling antidiagonals.at n=51A332099