1797
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2400
- Proper Divisor Sum (Aliquot Sum)
- 603
- 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
- 1196
- Möbius Function
- 1
- Radical
- 1797
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- Sum of 12 nonzero 8th powers.at n=7A003390
- Coordination sequence T3 for Zeolite Code MOR.at n=27A008184
- Coordination sequence T4 for Zeolite Code PAU.at n=31A008222
- Expansion of (1+x^5)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=48A008766
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=12A015994
- Numbers k such that the continued fraction for sqrt(k) has period 32.at n=23A020371
- Expansion of Product_{m >= 1} (1-m*q^m)^15.at n=5A022675
- a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=13A023109
- Numbers k such that Fibonacci(k) == 2 (mod k).at n=31A023174
- Index of 9^n within the sequence of the numbers of the form 2^i*9^j.at n=33A025734
- a(n) = (1/2)*(n-th largest even number in array T given by A027170).at n=47A027184
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 28.at n=11A031526
- Lucky numbers with size of gaps equal to 20 (upper terms).at n=1A031903
- Lucky numbers ending with digit 7.at n=45A032588
- Least number of Reverse-then-add persistence n.at n=13A033866
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 5).at n=35A035564
- Base-5 palindromes that start with 2.at n=33A043007
- Numbers n such that string 4,5 occurs in the base 7 representation of n but not of n-1.at n=41A044171
- Numbers n such that string 0,5 occurs in the base 8 representation of n but not of n-1.at n=30A044192
- Numbers n such that string 1,6 occurs in the base 9 representation of n but not of n-1.at n=25A044266