8022
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18432
- Proper Divisor Sum (Aliquot Sum)
- 10410
- 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
- 2280
- Möbius Function
- 1
- Radical
- 8022
- 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
- 189
- 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
- Expansion of 1/((1-x)(1-3x)(1-11x)(1-12x)).at n=3A021734
- Number of partitions of n into prime power parts (1 excluded).at n=51A023894
- Numbers whose base-6 representation has exactly 6 runs.at n=20A043614
- Numbers with exactly 4 distinct palindromic prime factors.at n=16A046402
- Numbers n such that A048767(n+1)=A048767(n).at n=15A048769
- Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.at n=19A053093
- Determinant of the n X n matrix whose element (i,j) equals f(|i-j|) where f(n) is 1 if the sum of middle divisors (A071090) > 0, else 0.at n=24A071548
- Expansion of (1-x)^(-1)/(1-x+x^2+2*x^3).at n=22A077873
- Least nontrivial multiple of the n-th prime beginning with 8.at n=42A078292
- Number of (k,m,n)-multiantichains of multisets with k=3 and m=6.at n=3A084883
- Triangle read by rows: T(n,k) is number of Dyck n-paths with k UUDDs, 0 <= k <= n/2.at n=39A098978
- Number of perfect rulers with n segments (n>=0).at n=11A103301
- Numbers k such that the representation of phi(k) is a cyclic permutation of that of k, in base 10.at n=8A113781
- Numbers k such that the decimal digits of phi(k) are a permutation of those of k.at n=18A115921
- Product of a prime number p and the number of primes smaller than p.at n=42A117495
- Number of base 10 circular n-digit numbers with adjacent digits differing by 7 or less.at n=4A125422
- Number of n X n arrays with entries in 1..10 in which adjacent entries differ by 7 or less (adjacent means in x or y directions).at n=2A125543
- The smallest superharmonic number with index n.at n=6A152573
- 3 times 9-gonal (or nonagonal) numbers: a(n) = 3*n*(7*n-5)/2.at n=28A152759
- n^3 + n-th cubefree number.at n=19A180499