2611
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
- 4
- Divisor Sum
- 2992
- Proper Divisor Sum (Aliquot Sum)
- 381
- 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
- 2232
- Möbius Function
- 1
- Radical
- 2611
- 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
- 53
- 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
- Number of partitions of n into at most 5 parts.at n=45A001401
- Hex (or centered hexagonal) numbers: 3*n*(n+1)+1 (crystal ball sequence for hexagonal lattice).at n=29A003215
- Pentagonal numbers written backwards.at n=28A004163
- Number of Young tableaux of height <= 7.at n=9A007578
- Coordination sequence T2 for Zeolite Code YUG.at n=33A008248
- a(n) = floor(n*(n-1)*(n-2)/21).at n=39A011903
- Composite numbers that are equal to the sum of the first k composites for some k.at n=46A013921
- Positive integers n such that 2^n == 2^7 (mod n).at n=57A015927
- Pseudoprimes to base 88.at n=20A020216
- Pseudoprimes to base 89.at n=34A020217
- Strong pseudoprimes to base 88.at n=6A020314
- Strong pseudoprimes to base 89.at n=6A020315
- Numbers k such that the continued fraction for sqrt(k) has period 42.at n=23A020381
- a(n) = least m such that if r and s in {1/3, 1/6, 1/9,..., 1/3n} satisfy r < s, then r < k/m < s for some integer k.at n=33A024824
- Index of 10^n within the sequence of the numbers of the form 2^i*10^j.at n=39A025740
- dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=15A026063
- Number of partitions of n in which the greatest part is 5.at n=50A026811
- Golc sequence in base 7. Left to right concatenation of n,int(log_7(n)),int(log_7(int(log_7(n)))),... in base7.at n=52A028437
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 13 (most significant digit on left).at n=16A029482
- Take list of cubes, move left digit of each term to end of previous term.at n=22A032761