9132
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
- 12
- Divisor Sum
- 21336
- Proper Divisor Sum (Aliquot Sum)
- 12204
- 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
- 3040
- Möbius Function
- 0
- Radical
- 4566
- Omega Function (Ω)
- 4
- 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
- no
- 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 that are the sum of 7 positive 7th powers.at n=29A003374
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (composite numbers).at n=23A024461
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (composite numbers).at n=22A025081
- Number of days in n years (n=1 is the first leap year).at n=24A033174
- Number of partitions of n into parts not of the form 9k, 9k+2 or 9k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 3 are greater than 1.at n=44A035941
- (s(n)+1)/10, where s(n)=n-th base 10 palindrome that starts with 9.at n=35A043088
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=47A052477
- a(n) = sigma_3(n) - sigma_2(n).at n=20A092349
- a(1) = 1, a(2) = 2, a(n+2) = a(n)#*#a(n+1) where #*# stands for digit-wise product of a(n) and a(n+1).at n=11A096096
- T(n,k) = [x^k] Product_{m=1..n} d/dx Sum_{i=1..m} x^i; triangle read by rows, n >= 0, 0 <= k <= A161680(n).at n=36A139769
- Number of cubic equations ax^3 + bx^2 + cx + d = 0 with integer coefficients |a|,|b|,|c|,|d| <= n, a <> 0, having three real roots, of which at least two are equal.at n=34A155192
- Numbers k>1 such that phi(phi(k)) = sigma(sopf(k)).at n=37A173337
- Number of symmetry classes of 3 X 3 semimagic squares with distinct positive values and magic sum n.at n=42A173725
- Numbers m such that all three values m^2 + 13^k, k = 1, 2, 3, are prime.at n=35A178639
- a(n) = floor((1 + 1/Pi)^n).at n=32A179492
- Numbers m having the same sum of divisors as m+20 has.at n=23A181647
- Numbers k such that 210*k+{11, 13, 17, 19, 23, 29} are 6 consecutive primes.at n=9A182282
- Largest coefficient of (1)(1+2x)(1+2x+3x^2)*...*(1+2x+3x^2+...+(n+1)*x^n).at n=5A186860
- Number of segments needed to draw (on the infinite square grid) a diagram of regions and partitions of n.at n=28A211026
- Number of genus 3 rooted hypermaps with n darts.at n=7A214818