1297
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1298
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1296
- Möbius Function
- -1
- Radical
- 1297
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 101
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 211
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) with a(0) = a(1) = a(2) = a(3) = 1.at n=13A000288
- Number of nonnegative solutions to x^2 + y^2 <= n^2.at n=40A000603
- Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.at n=13A000802
- Primes p of the form 3k+1 such that -sqrt(p) < sum_{x=1..p} cos(2*Pi*x^3/p) < sqrt(p).at n=29A000922
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=41A001000
- A sequence of sorted odd primes 3 = p_1 < p_2 < ... < p_m such that p_i-2 divides the product p_1*p_2*...*p_(i-1) of the earlier primes and each prime factor of p_i-1 is a prime factor of twice the product.at n=13A001259
- Primes p == 1 (mod 4) where class number of Q(sqrt p) increases.at n=5A002142
- Primes of the form 2^q*3^r*5^s + 1.at n=36A002200
- Primes of the form k^2 + 1.at n=10A002496
- a(n) = n^2 + 1.at n=36A002522
- a(n) = n^4 + 1.at n=6A002523
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=34A002569
- Quartan primes: primes of the form x^4 + y^4, x > 0, y > 0.at n=7A002645
- Numbers that are the sum of 2 positive 4th powers.at n=15A003336
- Sums of distinct nonzero 4th powers.at n=32A003999
- Numbers that are the sum of at most 2 nonzero 4th powers.at n=22A004831
- Class 1- (or Pierpont) primes: primes of the form 2^t*3^u + 1.at n=19A005109
- Primes p such that 2p-1 is also prime.at n=40A005382
- a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)).at n=17A005468
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=25A005529