650
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1302
- Proper Divisor Sum (Aliquot Sum)
- 652
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 240
- Möbius Function
- 0
- Radical
- 130
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 25
- Smith 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
Names
- German
- sechshundertfünfzig· ordinal: sechshundertfünfzigste
- English
- six hundred fifty· ordinal: six hundred fiftieth
- Spanish
- seiscientos cincuenta· ordinal: 650º
- French
- six cent cinquante· ordinal: six cent cinquantième
- Italian
- seicentocinquanta· ordinal: 650º
- Latin
- sescenti quinquaginta· ordinal: 650.
- Portuguese
- seiscentos e cinquenta· ordinal: 650º
Appears in sequences
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=13A000297
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=12A000330
- Numbers that are the sum of 2 squares in exactly 3 ways.at n=3A000443
- The convergent sequence A_n for the ternary continued fraction (3,1;2,2) of period 2.at n=10A000962
- a(n) = (3*n+1)*(3*n+2).at n=8A001504
- The coding-theoretic function A(n,4,4).at n=22A001843
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=46A002088
- Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).at n=25A002378
- Quarter-squares: a(n) = floor(n/2)*ceiling(n/2). Equivalently, a(n) = floor(n^2/4).at n=51A002620
- a(n) = 2*n*(2*n-1).at n=13A002939
- Cluster series for bond percolation problem on b.c.c. lattice.at n=3A003206
- Number of partially achiral trees with n nodes.at n=13A003243
- Numbers that are the sum of 11 positive 5th powers.at n=28A003356
- Numbers whose ternary expansion contains no 1's.at n=49A005823
- Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0).at n=18A005893
- Primitive pseudoperfect numbers.at n=14A006036
- Primitive nondeficient numbers.at n=13A006039
- Number of tree-rooted planar maps with 3 vertices and n faces and no isthmuses.at n=3A006432
- Number of tree-rooted planar maps with 4 faces and n vertices and no isthmuses.at n=2A006471
- a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.at n=23A006918