1260
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 4368
- Proper Divisor Sum (Aliquot Sum)
- 3108
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 288
- Möbius Function
- 0
- Radical
- 210
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 39
- Smith Number
- no
- Vampire Number
- yes
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
- Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.at n=41A000009
- Exponential generating function: (1+3*x)/(1-2*x)^(7/2).at n=3A000457
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=25A000793
- Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n.at n=26A000793
- a(n) = 9*binomial(2n,n-4)/(n+5).at n=4A001392
- a(n) = (5*n)!/((3*n)!*n!*n!).at n=2A001451
- Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=24A001497
- Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=24A001498
- Coefficients of Legendre polynomials.at n=2A001802
- Highly abundant numbers: numbers k such that sigma(k) > sigma(m) for all m < k.at n=46A002093
- Shuffling 2n cards.at n=35A002139
- Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.at n=15A002182
- Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).at n=35A002378
- Denominator in Feinler's formula for unsigned Bernoulli number |B_{2n}|.at n=17A002444
- Joffe's central differences of 0, A241171(n,n-1).at n=3A002456
- Denominators of coefficients for numerical differentiation.at n=9A002548
- Denominators of coefficients for numerical differentiation.at n=7A002548
- Denominators of Cauchy numbers of second type (= Bernoulli numbers B_n^{(n)}).at n=34A002790
- Increasing values of A000793 (largest order of permutation of n elements).at n=16A002809
- a(n) = 2*n*(2*n-1).at n=18A002939