9476
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17472
- Proper Divisor Sum (Aliquot Sum)
- 7996
- 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
- 4488
- Möbius Function
- 0
- Radical
- 4738
- 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
- 122
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite TON = Theta-1 Nan[AlnSi24-nO48] starting with a T4 atom.at n=12A019246
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=45A024854
- Numbers having three 8's in base 9.at n=35A043487
- Numbers k such that k^8 == 1 (mod 9^3).at n=25A056084
- Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).at n=38A082538
- a(n)=5a(n-1)+C(n+4,4),n>0, a(0)=1.at n=5A097791
- a(n) = Sum_{k=0..floor(n/2)} binomial(n,k)*2^(n-2*k).at n=10A100067
- Integers that are Rhonda numbers to more than one base.at n=13A100988
- Numbers n such that every digit occurs at least once in n^3.at n=41A119735
- Row sums of triangle A143102.at n=29A143103
- a(n) = 729*n - 1.at n=12A158395
- a(n) = 2*n*(9*n-1).at n=22A178574
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1.at n=42A180784
- Number of ways to place 2n nonattacking kings on a vertical cylinder 4 X 2n.at n=7A195590
- Number of ways to place 8n nonattacking kings on a 16 X 2n cylindrical chessboard.at n=1A195652
- Number of 2n X 4 0..2 arrays with values 0..2 introduced in row major order and each element equal to exactly two horizontal and vertical neighbors.at n=7A198279
- T(n,k)=Number of 2nX2k 0..2 arrays with values 0..2 introduced in row major order and each element equal to exactly two horizontal and vertical neighbors.at n=37A198285
- T(n,k)=Number of 2nX2k 0..2 arrays with values 0..2 introduced in row major order and each element equal to exactly two horizontal and vertical neighbors.at n=43A198285
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209767; see the Formula section.at n=41A209768
- Numbers k such that 18*k+1 is a square.at n=45A219395