9144
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 24960
- Proper Divisor Sum (Aliquot Sum)
- 15816
- 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
- 3024
- Möbius Function
- 0
- Radical
- 762
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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 MTT = ZSM-23 Nan[AlnSi24-nO48] starting with a T5 atom.at n=12A019190
- Expansion of Product_{m>=1} (1-m*q^m)^32.at n=4A022692
- Numerators of continued fraction convergents to sqrt(570).at n=5A042092
- Triangle of number of labeled rooted trees with n nodes and k leaves, n >= 1, 1 <= k <= n.at n=42A055302
- Number of labeled rooted trees with n nodes and 7 leaves.at n=1A055308
- Numbers k such that k | sigma_9(k) - phi(k)^9.at n=23A055703
- Numbers k such that sigma(x) = k has exactly 9 solutions.at n=24A060665
- Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).at n=23A064125
- Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: number of linearly inducible orderings of n points in k-dimensional Euclidean space.at n=31A071223
- Number of fib001 primes (A095086) in range ]2^n,2^(n+1)].at n=18A095066
- Four-column array read by rows: T(n,k) for k=0..3 is the k-th component of the vector obtained by multiplying the n-th power of the 4 X 4 matrix (1,1,1,1; 7,3,1,0; 12,2,0,0; 6,0,0,0) and the vector (1,1,1,1).at n=23A095797
- Positions where values change in A100144.at n=47A100250
- Number of products of factorials not exceeding n!.at n=20A101976
- Numbers k such that k + sigma(k) + phi(k) is a triangular number.at n=43A115906
- Coordination sequence for 6-dimensional cyclotomic lattice Z[zeta_9].at n=8A126899
- a(n) = denominator of b(n), where b(1)=1, b(n+1) = sum{k|n} 1/b(k).at n=10A127940
- Partial sums of A079062.at n=26A177455
- Square array in A071223 read by antidiagonals.at n=58A198889
- G.f. satisfies: A(x) = exp( Sum_{n>=1} A(-x^n)^3 * x^n/n ).at n=8A200402
- Number of n X 2 0..2 arrays with every row and column running average nondecreasing rightwards and downwards.at n=8A200528