8201
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8400
- Proper Divisor Sum (Aliquot Sum)
- 199
- 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
- 8004
- Möbius Function
- 1
- Radical
- 8201
- 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
- 114
- 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
- An approximation to population of x^2 + y^2 <= 2^n.at n=15A000692
- Numbers k such that the continued fraction for sqrt(k) has period 66.at n=40A020405
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=17A029580
- Numbers whose maximal base-9 run length is 4.at n=17A037999
- Numbers having four 2's in base 9.at n=1A043464
- Numbers whose base-4 representation contains exactly four 0's and two 2's.at n=21A045059
- Smallest value of x such that M(x) = n, where M() is Mertens's function A002321.at n=23A051400
- a(n) = 2*a(n-1) + 3*a(n-2), a(0) = 1, a(1) = 4.at n=8A060925
- Centered 10-gonal numbers.at n=40A062786
- Heights of peaks of more than 8000 meters (as of Sep 25 2001), in decreasing order.at n=5A064296
- Numbers n such that phi(2n-1) = sigma(n).at n=30A067230
- Numbers n such that sigma(n)=phi(n*bigomega(n)-1).at n=26A067877
- Numbers k such that sigma(k) = phi(k*omega(k)-1).at n=37A067878
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using A054238 as the pairing function N X N -> N.at n=32A072634
- Permutation of natural numbers induced by reranking plane binary trees given in the standard lexicographic order (A014486) with an "arithmetic global ranking algorithm", using packA054238tr as the packing bijection N X N -> N.at n=49A072636
- Numbers k such that A081249(m)/m^2 has a local minimum for m = k.at n=8A081250
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=31A082409
- Index of the first occurrence of prime(n) in A092938.at n=39A092939
- Numbers n such that pi(n) = reversal(n).at n=3A097644
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=24A098936