1727
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1896
- Proper Divisor Sum (Aliquot Sum)
- 169
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1560
- Möbius Function
- 1
- Radical
- 1727
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of nonequivalent dissections of a polygon into n quadrilaterals by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=6A005035
- Record values in A005210.at n=45A005211
- x^3 + n*y^3 = 1 is solvable.at n=37A005988
- Coordination sequence T2 for Zeolite Code MOR.at n=27A008183
- Coordination sequence T1 for Zeolite Code NAT.at n=28A008203
- Dates of accession of the Georges to the English throne.at n=1A008744
- Largest value of k for which Golay-Rudin-Shapiro sequence A020986(k) = n.at n=39A020991
- Numbers with exactly 9 ones in binary expansion.at n=20A023691
- a(n) = 12^n - 1.at n=3A024140
- a(n) = [ Sum{(log(j)-log(i))^3} ], 2 <= i < j <= n.at n=39A025207
- Number of partitions of n that do not contain 9 as a part.at n=25A027343
- a(n) = n^2 + n + 5.at n=41A027690
- [ exp(7/8)*n! ].at n=5A030958
- Numbers whose base-12 expansion has no run of digits with length < 2.at n=21A033025
- Third differences of Catalan numbers A000108.at n=6A033434
- Integers k such that 2^k == 7 (mod k).at n=3A033981
- Number of binary codes of length 11 with n words.at n=4A034196
- Number of binary codes (not necessarily linear) of length n with 4 words.at n=10A034199
- a(n) = sum of order of a mod n, 0 < a < n, gcd(a, n) = 1.at n=52A036391
- Gaps of 7 in sequence A038593 (upper terms).at n=11A038654