10797
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 4083
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6960
- Möbius Function
- -1
- Radical
- 10797
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=61A011902
- Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations.at n=24A015994
- 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=25A023109
- [ exp(16/21)*n! ].at n=6A030843
- Least number of Reverse-then-add persistence n.at n=25A033866
- Number of 5-ary rooted trees with n nodes and height at most 8.at n=13A036619
- a(n) = a(n-1) + a(n-2) + n^2 for n >= 3, a(1)=2, and a(2)=5.at n=13A179992
- 1/6 the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock containing all three values.at n=3A183596
- 1/6 the number of (n+1)X5 0..2 arrays with every 2X2 subblock containing all three values.at n=1A183598
- T(n,k)=1/6 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock containing all three values.at n=11A183603
- T(n,k)=1/6 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock containing all three values.at n=13A183603
- Conjectured number of digits in highest power of n with no four consecutive identical digits.at n=0A216142
- Conjectured number of digits in highest power of n with no four consecutive identical digits.at n=2A216142
- Conjectured number of digits in highest power of n with no four consecutive identical digits.at n=14A216142
- Number of n X 3 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=6A223639
- Number of nX7 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=2A223643
- T(n,k)=Number of nXk 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=38A223644
- T(n,k)=Number of nXk 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal.at n=42A223644
- a(n) = (a(n-1) * a(n-3) - (-1)^n * a(n-2)^2) / a(n-4) with a(1) = a(3) = a(4) = 1, a(2) = -2.at n=15A247378
- Number of set partitions of [n] into exactly four parts such that no part contains two elements with a circular distance less than three.at n=14A261480