9212
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 19152
- 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
- no
Derived Values
- Euler's Totient
- 3864
- Möbius Function
- 0
- Radical
- 658
- Omega Function (Ω)
- 5
- 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
- a(n) = floor(n*(n-1)*(n-2)/12).at n=49A011894
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DOH = Dodecasil 1H [Si34O68].qR starting with a T1 atom.at n=12A019113
- Number of partitions of n into parts not of the form 17k, 17k+7 or 17k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=34A035968
- Numbers whose base-4 representation contains exactly two 0's and four 3's.at n=29A045075
- Row sums of A051598.at n=11A053209
- T(n,n-3), array T as in A054106.at n=37A054107
- At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=23A056640
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=35A056750
- Number of diamond polyominoes with n cells.at n=9A056783
- Number of singular points on n-th order Chmutov surface.at n=28A057870
- Expansion of (1 + x)^2 / ((1 - x^2 - 2*x^3)*(1 + x^4)).at n=22A107849
- Number of squares in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid.at n=23A111746
- G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^5)^2.at n=7A137960
- a(n) = 16*n^2 - 4.at n=23A158443
- Number of binary strings of length n with equal numbers of 00001 and 01010 substrings.at n=14A164199
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) is a 4th power.at n=16A172464
- Numbers n such that phi(phi(n)) + sigma(sigma(n)) is an 8th power.at n=3A172465
- Number of strings of numbers x(i=1..5) in 0..n with sum i*x(i)^2 equal to n*25.at n=32A184444
- Number of n X 6 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=38A188863
- Increasing sequence generated by these rules: a(1)=1, and if x is in a then 3x-1 and x^2 are in a.at n=52A191289