9312
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 24696
- Proper Divisor Sum (Aliquot Sum)
- 15384
- 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
- 3072
- Möbius Function
- 0
- Radical
- 582
- Omega Function (Ω)
- 7
- 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
- yes
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
- Convolution of natural numbers >= 2 and (F(2), F(3), F(4), ...).at n=14A023550
- a(n) = (-1 + prime(n+1)^2)/4.at n=42A024701
- Sorted Galois numbers.at n=28A028689
- XOR-convolution of squares A000290 with themselves.at n=24A033460
- Multiplicity of highest weight (or singular) vectors associated with character chi_181 of Monster module.at n=39A034569
- Product of a prime and the previous number.at n=24A036689
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=32A045945
- Number of quasi-initially connected digraphs on n unlabeled nodes.at n=4A049512
- Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).at n=52A056242
- Third diagonal of triangle A056242.at n=7A056243
- Number of fixed convex polyominoes with n cells.at n=9A067675
- Numbers n such that sigma(reverse(n)) = phi(n).at n=11A070856
- a(n) = (prime(n)+1)*(prime(n+1)+1)/4.at n=42A079079
- a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.at n=24A087094
- Number of partitions of n with parts occurring at most thrice and an even number of parts. Row sums of A098489.at n=43A098491
- Number of partitions of n with parts occurring at most thrice and an odd number of parts. Row sums of A098490.at n=43A098492
- Positive integers k such that k^20 + 1 is semiprime (A001358).at n=35A105282
- Self-COMPOSE of A107700; thus g.f. A(x) = G(G(x)) = x + 2*G(x)^2, where G(x) is the g.f. of A107700.at n=12A107701
- a(n) = (p-1)! mod p^2 where p = n-th prime.at n=33A112660
- Record gaps between twin primes.at n=42A113274