8162
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 7390
- 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
- 3120
- Möbius Function
- 1
- Radical
- 8162
- 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
- 52
- 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
- A problem of configurations: a(0) = 1; for n>0, a(n) = (2n-1)!! - Sum_{k=1..n-1} (2k-1)!! a(n-k). Also the number of shellings of an n-cube, divided by 2^n n!.at n=6A000698
- Cluster series for bond percolation problem on honeycomb.at n=14A003199
- a(n) = n*(n+1)*(5*n+1)/6.at n=20A033994
- Multiplicity of highest weight (or singular) vectors associated with character chi_34 of Monster module.at n=41A034422
- Positive numbers having the same set of digits in base 9 and base 10.at n=31A037443
- (s(n)+2)/10, where s(n)=n-th base 10 palindrome that starts with 8.at n=38A043087
- Erroneous version of A000698.at n=6A046863
- a(n) = a(n-1) + rotate( a(n-1), 1 digit left), a(1) = 1.at n=9A051299
- a(n) = prime(2^n) + 1.at n=10A051440
- Number of directed cycles of B-trees of order 3 with n labeled leaves.at n=16A058519
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=40A062483
- Inverse Moebius transform of perfect numbers, A000396.at n=3A062819
- Numbers n such that n and its reversal are both multiples of 14.at n=39A062904
- Non-palindromic number and its reversal are both multiples of 14.at n=27A062913
- First differences of (n+1)^6-n^6 (A022522).at n=3A069473
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.at n=38A073798
- Triangle of coefficients, read by rows of (2n+1) terms, where the n-th row forms a polynomial in x, P(n,x), of degree 2n and satisfies: P(n,x) = [Sum_{k=1..n} 1/(k + x + x^2)]*[Product_{k=1..n} (k + x + x^2)].at n=43A074248
- Numbers k such that A007923(k) is prime.at n=15A075766
- Sums of (one or more distinct) k-perfect numbers.at n=34A083865
- Number of numbers with 6 decimal digits and sum of digits = n.at n=13A090581