9492
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25536
- Proper Divisor Sum (Aliquot Sum)
- 16044
- 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
- 2688
- Möbius Function
- 0
- Radical
- 4746
- Omega Function (Ω)
- 5
- 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
- 78
- 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
- Coordination sequence for A_6 lattice.at n=4A008387
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 8.at n=16A022313
- Numbers k such that k | sigma_7(k).at n=41A055711
- a(0) = 1; a(n) = sum_{k=1 to d(n)} [a(n-k)] where d(n) is number of positive divisors of n.at n=16A055873
- Staircase of coefficients of polynomials used for column g.f.s of triangle A060923.at n=45A061186
- Write 1, 2, 3, 4, ... counterclockwise in a hexagonal spiral around 0 starting left down, then a(n) is the sequence found by reading from 0 in the vertical upward direction.at n=28A063436
- Zero, together with positive numbers k such that prime(k) - k is a square.at n=35A064370
- a(n) = n*(2*n^2 + n + 1)/2.at n=20A085786
- Square array T(n,k) (n >= 1, k >= 0) read by antidiagonals: coordination sequence for root lattice A_n.at n=49A103881
- Numbers n such that prime(n) - n is a perfect power.at n=42A107607
- Numbers n such that phi(n) = phi(n + phi(n)).at n=48A108569
- Terms of A068563 that are not terms of A124240.at n=39A124241
- Triangle read by rows: T(n,k) is the number of set partitions of the set {1,2,...,n} (or of any n-set) containing k blocks of size 3 (0<=k<=floor(n/3)).at n=19A124503
- a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=15A145537
- Number of integer sequences of length n+1 with sum zero and sum of absolute values 8.at n=5A157053
- T(n,k)=number of increasing sequences of n integers x(1),...,x(n) with values in 1..k*n such that x(j) divides x(k) if j divides k.at n=59A180383
- Number of n X 4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,1,2,4,0 for x=0,1,2,3,4.at n=4A197075
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,1,2,4,0 for x=0,1,2,3,4.at n=3A197076
- T(n,k) = Number of n X k 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,1,2,4,0 for x=0,1,2,3,4.at n=32A197079
- T(n,k) = Number of n X k 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,1,2,4,0 for x=0,1,2,3,4.at n=31A197079