12797
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13056
- Proper Divisor Sum (Aliquot Sum)
- 259
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12540
- Möbius Function
- 1
- Radical
- 12797
- 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
- 169
- 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 rhyme schemes (see reference for precise definition).at n=6A005003
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24.at n=43A051965
- Number of primes between n^5 and (n+1)^5.at n=13A062517
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=30A063048
- a(n)=A074639(A074647(n)).at n=38A074648
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=31A088753
- a(n) = 8*n^2 - 3.at n=39A108928
- Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=32A111036
- Denominators a(n) of Pythagorean approximations b(n)/a(n) to 5/4.at n=6A195565
- Numerators b(n) of Pythagorean approximations b(n)/a(n) to 4/5.at n=3A195611
- Numbers k such that k^3 + 3*k + 3^k is prime.at n=21A220701
- Number of partitions of n not containing the number of distinct parts as a part.at n=37A239946
- Index sequence for limit-block extending A000002 (Kolakoski sequence) with first term as initial block.at n=37A246145
- Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 with each element having directed index change -2,-2 -1,0 0,1 or 1,0.at n=10A264528
- Numbers k such that k!6 - 12 is prime, where k!6 is the sextuple factorial number (A085158).at n=23A289688
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome and does not join the trajectory or one of the reverse numbers of the trajectory of any term m < k.at n=29A306232
- Number of separable partitions of n in which the number of distinct (repeatable) parts is > 2.at n=35A325717
- Number of binary matrices with a total of n ones, distinct columns each with the same number of ones and nonzero rows in nonincreasing lexicographic order.at n=11A331391
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] exp(x+y) / (exp(x) + exp(y) - exp(x+y))^4.at n=38A382674
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = n! * k! * [x^n * y^k] exp(x+y) / (exp(x) + exp(y) - exp(x+y))^4.at n=42A382674