9612
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
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 15588
- 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
- 3168
- Möbius Function
- 0
- Radical
- 534
- 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
- 60
- 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
- Numbers k such that (k / product of digits of k) is 1 or a prime.at n=30A001103
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=31A005901
- Numbers k such that 141*2^k+1 is prime.at n=39A032420
- Numbers divisible by the sum and product of their digits.at n=43A038186
- 4n^2+1, 2n^2+1, 2n^2-1 are all prime.at n=25A055755
- a(1) = 4; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.at n=4A061361
- Numbers k such that sigma(k) = 2*usigma(k).at n=27A063880
- a(1) = 64; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.at n=3A065790
- Antidiagonal sums of table A084287, in which the k-th row is the product of the k-th prime with the antidiagonals of the first k rows of the table.at n=13A084288
- Triangle, read by rows, such that the convolution of each row with {1,2} produces a triangle which, when flattened, equals this flattened form of the original triangle.at n=45A092686
- First column and main diagonal of triangle A092686, in which the convolution of each row with {1,2} produces a triangle that, when flattened, equals the flattened form of A092686.at n=9A092687
- Lower triangular array, called S1hat(6), related to partition number array A145356.at n=31A145357
- Lower triangular array, called S1hat(6), related to partition number array A145356.at n=40A145357
- Numbers k such that 120*k + 1 is a term in A163573.at n=34A163625
- Triangle T read by rows : T(n,k)= A007318(n,k)*A005773(n-k).at n=47A171670
- Number of line segments connecting exactly 10 points in an n x n grid of points.at n=38A177726
- Square array A(n,k), n>=1, k>=1, read by antidiagonals: A(n,k) is the number of n-colorings of the square grid graph G_(k,k).at n=18A182406
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles.at n=38A186761
- T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions.at n=31A187162
- Number of 4-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=4A187165