2116
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 9
- Divisor Sum
- 3871
- Proper Divisor Sum (Aliquot Sum)
- 1755
- 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
- 1012
- Möbius Function
- 0
- Radical
- 46
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Squares that are not the sum of 2 nonzero squares.at n=28A000548
- A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n.at n=51A001149
- a(n) = Sum_{k=0..n} 2^binomial(n,k).at n=5A001315
- a(n) = (prime(n) - 1)^2.at n=14A005722
- Erroneous version of A048798.at n=44A007914
- Product of divisors of n.at n=45A007955
- Coordination sequence for Paracelsian.at n=31A008260
- Powers of 46.at n=2A009990
- In the prime factorization of n, increment odd powers and decrement even powers (multiplicative and self-inverse).at n=45A011262
- Numbers that are not the sum of a square and a prime.at n=39A014090
- Even squares: a(n) = (2*n)^2.at n=23A016742
- a(n) = (3*n+1)^2.at n=15A016778
- a(n) = (4n + 2)^2.at n=11A016826
- a(n) = (5*n + 1)^2.at n=9A016862
- a(n) = (6*n + 4)^2.at n=7A016958
- a(n) = (7*n + 4)^2.at n=6A017030
- a(n) = (8*n+6)^2.at n=5A017138
- a(n) = (9*n + 1)^2.at n=5A017174
- a(n) = (10*n + 6)^2.at n=4A017342
- a(n) = (11*n + 2)^2.at n=4A017414