9884
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19824
- Proper Divisor Sum (Aliquot Sum)
- 9940
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 4942
- 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
- 135
- 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
- Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also sum of numbers in row n+1 of the array T in A026268.at n=9A026299
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 52.at n=2A093252
- Sum of squares of tetranacci numbers (A001630).at n=9A107242
- Inverse Moebius transform of the shifted tetrahedral numbers.at n=36A116963
- Triangle U, read by rows, where column k of U^(j+1) = column j of P^(3k+1) for j>=0, k>=0 and P=A136220.at n=23A136228
- Numbers k such that the number of digits d in k^2 is not prime and for each factor f of d the sum of the d/f digit groupings in k^2 of size f is a square.at n=31A153745
- Numbers k such that there are 8 digits in k^2 and for each factor f of 8 (1,2,4) the sum of digit groupings of size f is a square.at n=21A153746
- Number of ways to place zero or more nonadjacent 1,1 2,0 2,1 3,2 3,3 4,1 4,2 5,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155405
- a(n)=Mod(2^Fibonacci(n),Fibonacci(n)).at n=20A171244
- 1/4 the number of arrangements of n+1 nonzero numbers x(i) in -4..4 with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=4A189946
- T(n,k)=1/4 the number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=32A189951
- 1/4 the number of arrangements of 6 nonzero numbers x(i) in -n..n with the sum of sign(x(i))*(|x(i)| mod x(i+1)) equal to zero.at n=3A189955
- Number of arrays of n+2 integers in -4..4 with sum zero and adjacent elements differing in absolute value.at n=3A202958
- T(n,k)=Number of arrays of n+2 integers in -k..k with sum zero and adjacent elements differing in absolute value.at n=24A202962
- Number of arrays of 6 integers in -n..n with sum zero and adjacent elements differing in absolute value.at n=3A202966
- Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A238074
- Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A238076
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A238081
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=5A238081
- Number of partitions p of n such that p contains fewer 1s than its conjugate.at n=36A240690