623
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 720
- Proper Divisor Sum (Aliquot Sum)
- 97
- 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
- 528
- Möbius Function
- 1
- Radical
- 623
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 131
- Smith 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
Names
- German
- sechshundertdreiundzwanzig· ordinal: sechshundertdreiundzwanzigste
- English
- six hundred twenty-three· ordinal: six hundred twenty-third
- Spanish
- seiscientos veintitrés· ordinal: 623º
- French
- six cent vingt-trois· ordinal: six cent vingt-troisième
- Italian
- seicentoventitre· ordinal: 623º
- Latin
- sescenti viginti tres· ordinal: 623.
- Portuguese
- seiscentos e vinte e três· ordinal: 623º
Appears in sequences
- One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes.at n=23A000701
- Divisors of 2^33 - 1.at n=5A003540
- Number of partitions of 1/n into 3 reciprocals of positive integers.at n=41A004194
- a(n) = n*(11*n^2 - 5)/6.at n=7A004467
- Number of directed animals of size n (k=1 column of A038622); number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, where s(0) = 2; also sum of row n+1 of array T in A026323.at n=7A005774
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=125A006509
- Coordination sequence T2 for Zeolite Code ATS.at n=18A008039
- Coordination sequence T2 for Zeolite Code GOO.at n=17A008112
- a(n) = n^2 - 2.at n=24A008865
- E.g.f.: tanh(log(1+x))*cos(x).at n=7A009776
- Coordination sequence T2 for Zeolite Code RTE.at n=17A009891
- Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year.at n=6A014088
- a(n) = solution to the postage stamp problem with 2 denominations and n stamps.at n=46A014616
- Numbers k such that phi(k) divides sigma_5(k).at n=40A015763
- Numbers k such that phi(k + 4) | sigma(k).at n=47A015820
- Numbers k such that phi(k + 4) | sigma(k) for k not congruent to 0 (mod 3).at n=38A015847
- Numbers k such that phi(k + 7) | sigma(k) for k not congruent to 0 (mod 3).at n=39A015848
- a(n) = 12*n + 11.at n=51A017653
- Pseudoprimes to base 90.at n=1A020218
- Fibonacci sequence beginning 0, 7.at n=11A022090