2772
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 8736
- Proper Divisor Sum (Aliquot Sum)
- 5964
- 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
- 720
- Möbius Function
- 0
- Radical
- 462
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 35
- 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
- Number of rooted cubic maps with 2n nodes and a distinguished Hamiltonian cycle: (2n)!(2n+1)! / (n!^2*(n+1)!(n+2)!).at n=4A000356
- a(n) = (2n+1)!/n!^2.at n=5A002457
- High-temperature series for spin-1/2 Ising magnetic susceptibility on diamond structure.at n=7A003119
- Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.at n=60A003506
- a(n) = floor(1000*log(n)).at n=15A004240
- Number of rooted trees with 3 nodes of disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.at n=6A005173
- a(n) = (n+1)*(n^2+n+2)/2; g.f.: (1 + 2*x^2) / (1 - x)^4.at n=17A006000
- Denominators of a continued fraction for 1 + sqrt(2).at n=1A006272
- Number of rooted toroidal maps with 2 faces, n vertices and no isthmuses.at n=4A006469
- Co-growth function of a certain group.at n=3A007986
- a(1)=1; for n >= 1, a(n+1) = lcm(a(n),n) / gcd(a(n),n).at n=11A008339
- Aliquot sequence starting at 276.at n=9A008892
- Let j = | i - i_written_backwards |, k = j + j_written_backwards; then k is in this sequence.at n=25A008920
- Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=14A020875
- Arrange the nontrivial binomial coefficients C(m,k) (2 <= k <= m-2) in increasing order; record the positions of the central binomial coefficients.at n=10A022913
- a(n) = (n+1)*binomial(n+6,6).at n=5A027818
- a(n) = 42*(n+1)*binomial(n+6,10).at n=1A027822
- Numbers that are palindromic in bases 10 and 15.at n=18A029970
- a(n) = n*(2*n+5).at n=36A033537
- a(n) = f(n,4) where f is given in A034261.at n=7A034264