8382
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18432
- Proper Divisor Sum (Aliquot Sum)
- 10050
- 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
- 2520
- Möbius Function
- 1
- Radical
- 8382
- 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
- 109
- 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
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=39A000092
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=42A000338
- Positive integers k such that k-th triangular number is palindromic.at n=21A008509
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite SGT = Sigma-2 [Si64O128].4R starting with a T2 atom.at n=12A019237
- Self-convolution of array T given by A026692.at n=7A026991
- Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=41A036000
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) = cn(4,5)).at n=51A036818
- Numbers whose base-7 representation contains exactly four 3's.at n=9A043408
- Numbers which are the sum of their proper divisors containing the digit 9.at n=24A059468
- Index of the smallest n-digit palindromic triangular number, or 0 if no such number exists.at n=7A068642
- Triangle read by rows, in which n-th row contains smallest set of n consecutive numbers with distinct prime signatures.at n=52A083788
- The sixth column of triangle A091492, excluding leading zeros.at n=46A091498
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 3.at n=8A094831
- Number of partitions of n such that the least part occurs exactly five times.at n=45A097093
- Inverse Euler transform of A000960.at n=20A099066
- Numbers k such that the k-th triangular number contains only digits {1,3,5}.at n=11A119114
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, -1), (1, 0, -1), (1, 0, 1)}.at n=8A149328
- a(n) = 289n + 1.at n=28A158255
- a(n) is the smallest positive multiple k of n such that every length of the runs of 0's and 1's in the binary representation of k is coprime to n.at n=65A162537
- The number of imperfect staircase polygons counted by diagonal length (also the distance of the terminal vertex from the origin).at n=5A173409