1201
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1202
- 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
- 1200
- Möbius Function
- -1
- Radical
- 1201
- 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
- 57
- 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
- 197
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=a(2)=1.at n=13A000213
- 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=27A000922
- a(n) = ceiling(n^2/2).at n=49A000982
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/4.at n=11A001134
- a(n) is the solution to the postage stamp problem with n denominations and 3 stamps.at n=23A001213
- Squares written in base 6.at n=17A001741
- Centered square numbers: a(n) = 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z=Y+1) ordered by increasing Z; then sequence gives Z values.at n=24A001844
- Primes of the form 2^q*3^r*5^s + 1.at n=35A002200
- a(n) = a(n-1) - 2*a(n-2) with a(0) = 2, a(1) = 1.at n=20A002249
- Half-quartan primes: primes of the form p = (x^4 + y^4)/2.at n=3A002646
- A variant of the cuban primes: primes p = (x^3 - y^3)/(x - y) where x = y + 2.at n=5A002648
- Primes p with a Fibonacci primitive root g, i.e., such that g^2 = g + 1 (mod p).at n=53A003147
- Divisible only by primes congruent to 4 mod 7.at n=37A004622
- Primes written in base 4.at n=24A004678
- Class 4+ primes (for definition see A005105).at n=18A005108
- Primes p such that (p+1)/2 is prime.at n=23A005383
- Primitive prime factors of the sequence k^2 + 1 (A002522) in the order that they are found.at n=33A005529
- Prime-indexed primes: primes with prime subscripts.at n=44A006450
- Emirps (primes whose reversal is a different prime).at n=50A006567
- Numbers in base 3.at n=46A007089