8141
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9312
- Proper Divisor Sum (Aliquot Sum)
- 1171
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6972
- Möbius Function
- 1
- Radical
- 8141
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 158
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 94.at n=18A020433
- Number of positive integers <= 2^n of form 8 x^2 + 9 y^2.at n=17A054191
- a(n) = Fibonacci(n+1)^2 + 4*Fibonacci(n).at n=10A057592
- Triangle read by rows: T(n,k) gives number of r-bicoverings of an n-set with k blocks, n >= 2, k = 3..n+floor(n/2).at n=25A060052
- If p(x) is the x-th prime, then the n-th set of 4 consecutive sexy prime pairs starts at p(a(n)).at n=13A095963
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=19A098936
- a(n) = prime(2^n) - 2*n.at n=9A141088
- Number of slanted 2 X n (i=1..2) X (j=i..n+i-1) 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=44A165392
- a(n) = (11*n^2 + 11*n - 20)/2.at n=37A166144
- Number of permutations of 1..n with displacements restricted to {-4,0,1,2,3}.at n=13A189584
- Number of solutions to a+b+c = d+e+f with 0 < a <= n, 0 <= b,c,d,e,f <= n.at n=6A197083
- a(n) = 6*n^2 + 10*n + 5.at n=36A201279
- Number of compositions of n such that the first part is 1 and the second differences of the parts are in {-n,...,n}.at n=15A239561
- a(n) = A070952(2^n).at n=13A246023
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 84", based on the 5-celled von Neumann neighborhood.at n=37A270106
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k*x)*(sec(x) + tan(x)).at n=60A292975
- a(n) = n! * [x^n] exp(n*x)*(sec(x) + tan(x)).at n=5A292976
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=7A317031
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=47A317036
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=52A317036