9898
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 34
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17442
- Proper Divisor Sum (Aliquot Sum)
- 7544
- 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
- 4200
- Möbius Function
- 0
- Radical
- 1414
- 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
- 29
- 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
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with initial conditions a(0..3) = (0, 0, 1, 0).at n=18A001631
- Length of n-th term in Look and Say sequences A005150 and A007651.at n=32A005341
- Numbers whose base-2 representation has exactly 12 runs.at n=23A043579
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=26A063055
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=30A072607
- a(n) = smallest multiple of 7 with a digit sum = n.at n=32A077493
- Numbers which are either a divisor or a multiple of their 9's complement.at n=29A084020
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=38A090495
- Numbers k such that 7*10^k + 9 is prime.at n=26A097954
- a(n) = (n+1)(n+2)^3*(n+3)^2*(n+4)(5n^2 + 23n + 30)/8640.at n=4A107966
- Minimal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=37A110611
- Numbers k such that k and k^2 use only the digits 0, 4, 7, 8 and 9.at n=21A136959
- Numbers with rounded up arithmetic mean of digits = 9.at n=37A178369
- Number of -3..3 arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero.at n=3A200425
- T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and no two or three adjacent elements summing to zero.at n=18A200430
- Number of -n..n arrays x(0..6) of 7 elements with zero sum and no two or three adjacent elements summing to zero.at n=2A200434
- Number of representations of n as a sum of products of distinct pairs of positive integers, considered to be equivalent when terms or factors are reordered.at n=39A211856
- Numbers that are equal to the sum of the uniform platonic polyhedral (figurate) numbers (tetrahedral, cubic, octahedral, dodecahedral, or icosahedral) on each of their digits.at n=33A218539
- Numbers k such that k*7^k + 1 is prime.at n=2A242177
- Even integers concatenated with themselves.at n=48A248422