8982
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19500
- Proper Divisor Sum (Aliquot Sum)
- 10518
- 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
- 2988
- Möbius Function
- 0
- Radical
- 2994
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 184
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 94.at n=11A031592
- Number of basis partitions of n+49 with Durfee square size 7.at n=23A053802
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=22A055755
- Numbers n such that Pi^(n*e)-e^n is closer to its nearest integer than any value of Pi^(k*e)-e^k for 1 <= k < n.at n=11A080280
- Numbers k such that the decimal digits of phi(k) are a permutation of those of k.at n=20A115921
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=31A119864
- Designed symmetrical sequence with 2*3^n row sum and term: row(n)=3^n; f(n,m) = Floor[(m/Prime[n])*row(n)/2].at n=40A153290
- Integers whose binary digits "1" define, if sorted into a quadrant shape whose right angle lies in a Go board corner, same colored Go stones that surely live all, but not if any stone is omitted.at n=14A166537
- Partial sums of Pillai primes (A063980).at n=35A172034
- Dimensions of Lie algebras connected with the graded connected commutative Hopf algebra Sym^(3).at n=6A185162
- Triangle read by rows: T(n,k) is the number of length n left factors of Dyck paths having k DUU's, where U=(1,1) and D=(1,-1).at n=59A191795
- Number of 0..n arrays x(0..9) of 10 elements with zero 5th differences.at n=32A200446
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 n X 2 array.at n=9A220198
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=18A228963
- a(n) = Sum_{i=0..n} digsum_3(i)^4, where digsum_3(i) = A053735(i).at n=43A231505
- Number of partitions of n such that no part is a sum of two other parts.at n=44A236912
- Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=5A251229
- Number of (n+1) X (6+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=0A251234
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=15A251236
- T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock summing to 6 and no 2 X 2 subblock having exactly two nonzero entries.at n=20A251236