8142
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 9138
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2552
- Möbius Function
- 1
- Radical
- 8142
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 158
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of labeled dyslexic rooted compound windmills with n nodes.at n=5A038038
- (s(n)+2)/10, where s(n)=n-th base 10 palindrome that starts with 8.at n=36A043087
- Numbers k such that sigma(k+1) divides sigma(k), where sigma(k) is the sum of positive divisors of k.at n=18A058073
- Numbers k such that gcd(sigma(k), sigma(k+1)) > k.at n=27A066025
- Numbers k such that the sum of digits of k^k is a square.at n=48A066236
- A077388 sorted and duplicates removed.at n=41A082638
- Triangle T(n,k) read by rows, defined by T(n,k) = (n-k)*T(n-1,k)+Sum(k=1..n, T(n-1,k)); T(1,1) = 1, T(1,k)= 0 if k >1.at n=25A089225
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=11A093058
- a(n) = dimension of the space in which the sphere of radius n is of maximum volume.at n=35A121546
- Smallest sum of n consecutive odd primes which is a multiple of n.at n=45A132810
- Triangle T(n, k) = n!*Sum_{j=k..n} (-1)^(j+k)*binomial(k+j, j)/j!, read by rows.at n=33A156984
- Numbers k such that sigma(k) = 2*sigma(k+1).at n=8A163193
- Number of nondecreasing arrangements of 5 numbers x(i) in -(n+3)..(n+3) with the sum of sign(x(i))*x(i)^2 zero.at n=34A188005
- Position of 2^n in A051037 (5-smooth numbers).at n=54A188425
- Number of permutations of 6 copies of 1..n introduced in order 1..n with no element equal to another within a distance of 1.at n=3A190835
- Number of permutations of n copies of 1..3 introduced in order 1..3 with no element equal to another within a distance of 1.at n=6A190917
- Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor.at n=17A199126
- Number A(n,k) of initially rising meander words, where each letter of the cyclic k-ary alphabet occurs n times; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=51A209349
- Denominators of Bernoulli numbers which are == 6 (mod 9).at n=30A218755
- The number of ordered trees with bicolored single edges on the boundary.at n=8A228343