2059
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2160
- Proper Divisor Sum (Aliquot Sum)
- 101
- 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
- 1960
- Möbius Function
- 1
- Radical
- 2059
- 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
- 37
- 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
- Heptagonal numbers (or 7-gonal numbers): n*(5*n-3)/2.at n=29A000566
- a(n) = 3^n - 2^n.at n=7A001047
- Numbers that are the sum of 12 positive 11th powers.at n=1A004823
- Numbers that are the sum of at most 12 positive 11th powers.at n=24A004918
- Centered tetrahedral numbers.at n=14A005894
- a(n) = 2^n + n.at n=11A006127
- Coordination sequence T3 for Zeolite Code FER.at n=28A008108
- Coordination sequence T2 for Zeolite Code RUT.at n=30A009898
- a(0) = 1, a(n) = 17*n^2 + 2 for n>0.at n=11A010007
- Odd heptagonal numbers (A000566).at n=14A014637
- Six iterations of Reverse and Add are needed to reach a palindrome.at n=39A015984
- Pseudoprimes to base 20.at n=13A020148
- Pseudoprimes to base 23.at n=24A020151
- Pseudoprimes to base 30.at n=20A020158
- Pseudoprimes to base 34.at n=28A020162
- Pseudoprimes to base 45.at n=21A020173
- Pseudoprimes to base 51.at n=15A020179
- Pseudoprimes to base 91.at n=27A020219
- Pseudoprimes to base 94.at n=27A020222
- Strong pseudoprimes to base 20.at n=4A020246