1794
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 4032
- Proper Divisor Sum (Aliquot Sum)
- 2238
- 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
- 528
- Möbius Function
- 1
- Radical
- 1794
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=22A000125
- 9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7*n-5)/2.at n=23A001106
- Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=11A002414
- Number of 4-line partitions of n (i.e., planar partitions of n with at most 4 lines).at n=13A002799
- Number of partitions of n that do not contain 1 as a part.at n=33A002865
- Numbers that are the sum of 9 nonzero 8th powers.at n=7A003387
- Number of points on surface of tricapped prism: a(n) = 7*n^2 + 2 for n > 0, a(0)=1.at n=16A005919
- Coordination sequence T1 for Zeolite Code NES.at n=27A008205
- Coordination sequence T6 for Zeolite Code PAU.at n=31A008224
- Coordination sequence T5 for Zeolite Code -CLO.at n=38A009854
- Coordination sequence T1 for Zeolite Code VNI.at n=26A009907
- Coordination sequence T5 for Zeolite Code VNI.at n=26A009911
- a(0) = 1, a(n) = 28*n^2 + 2 for n>0.at n=8A010018
- Number of rooted trees on n nodes with forbidden limbs.at n=11A014267
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(2,8).at n=5A018916
- a(n) = n*(25*n - 1)/2.at n=12A022282
- Fibonacci sequence beginning 1, 32.at n=10A022402
- a(n) = Sum_{k=0..n} (k+1) * A026758(n, k).at n=8A027235
- a(n) = n*(n+7).at n=39A028563
- Even 9-gonal (or enneagonal) numbers.at n=11A028992