2450
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
- 18
- Divisor Sum
- 5301
- Proper Divisor Sum (Aliquot Sum)
- 2851
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 840
- Möbius Function
- 0
- Radical
- 70
- Omega Function (Ω)
- 5
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 2*n^2.at n=35A001105
- a(n) = (3*n+1)*(3*n+2).at n=16A001504
- Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).at n=49A002378
- a(n) = 2*n*(2*n-1).at n=25A002939
- Numbers that are the sum of 10 positive 7th powers.at n=13A003377
- Number of walks of length n on square lattice, starting at origin, staying in first quadrant.at n=7A005566
- Coordination sequence T2 for Zeolite Code THO.at n=35A008239
- a(0) = 1, a(n) = 17*n^2 + 2 for n>0.at n=12A010007
- Positive nonsquare integers k such that each term of the regular continued fraction of sqrt(k) divides k.at n=48A013654
- Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives triangle of numbers f(n,k)/n.at n=17A019576
- Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1<=k<=n; sequence gives f(n,3)/n.at n=3A019578
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor((n+1)/2).at n=27A024305
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers >= 2), t = (natural numbers >= 3).at n=26A024306
- a(n) = 2*(n+1) + 3*n + ... + (k+1)*(n+2-k), where k = floor(n/2).at n=26A024868
- (d(n)-r(n))/2, where d = A008778 and r is the periodic sequence with fundamental period (1,1,0,1).at n=27A026052
- Numbers with 18 divisors.at n=42A030636
- "AFK" (ordered, size, unlabeled) transform of 2,2,2,2,...at n=14A032005
- Numbers that, when expressed in base 5 and then interpreted in base 10, yield a multiple of the original number.at n=32A032543
- Numbers whose set of base-9 digits is {2,3}.at n=26A032809
- Every run of digits of n in base 9 has length 2.at n=26A033007