2541
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4256
- Proper Divisor Sum (Aliquot Sum)
- 1715
- 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
- 1320
- Möbius Function
- 0
- Radical
- 231
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 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
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Triangle of coefficients in expansion of (1+11x)^n.at n=30A013618
- a(n) = (2*n - 1)*n^2.at n=11A015237
- Expansion of 1/((1-x)*(1-4*x)*(1-5*x)).at n=4A016218
- Coordination sequence T1 for Zeolite Code OSI.at n=33A016430
- Number of terms in 7th derivative of a function composed with itself n times.at n=6A022817
- Positive numbers k such that k and 2*k are anagrams in base 7 (written in base 7).at n=1A023068
- Number of terms in n-th derivative of a function composed with itself 7 times.at n=7A024207
- Partial sums of the sequence of prime powers (A000961).at n=45A024918
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=26A025000
- a(n) = T(2n,n-2), where T is the array in A026120.at n=5A026131
- Golc sequence in base 2. Left to right concatenation of n,int(log_2(n)),int(log_2(int(log_2(n)))),... in base 2.at n=38A028432
- Numbers whose set of base-9 digits is {3,4}.at n=18A032833
- a(n) = (2*n+1)*(12*n+1).at n=10A033576
- Least number of Sort-then-add persistence n.at n=28A033863
- Divisors = 1 (mod 4) of Descartes's 198585576189.at n=33A033870
- Least number of Sort-then-add persistence n.at n=28A033908
- Fractional part of square root of a(n) starts with 4: first term of runs.at n=49A034110
- Number of partitions of n into parts not of the form 17k, 17k+7 or 17k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=27A035968
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*11^j.at n=8A038277
- Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*1^j.at n=33A038315