957
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1440
- Proper Divisor Sum (Aliquot Sum)
- 483
- 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
- 560
- Möbius Function
- -1
- Radical
- 957
- Omega Function (Ω)
- 3
- 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
- 54
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- neunhundertsiebenundfünfzig· ordinal: neunhundertsiebenundfünfzigste
- English
- nine hundred fifty-seven· ordinal: nine hundred fifty-seventh
- Spanish
- novecientos cincuenta y siete· ordinal: 957º
- French
- neuf cent cinquante-sept· ordinal: neuf cent cinquante-septième
- Italian
- novecentocinquantasette· ordinal: 957º
- Latin
- nongenti quinquaginta septem· ordinal: 957.
- Portuguese
- novecentos e cinquenta e sete· ordinal: 957º
Appears in sequences
- Odd squarefree numbers with an odd number of prime factors that have no prime factors greater than 31.at n=39A002556
- Numbers k such that k and k+1 have same sum of divisors.at n=2A002961
- a(n) = (4*n+1)*(4*n+5).at n=7A003185
- a(n) = cost of minimal multiplication-cost addition chain for n.at n=52A005766
- Coordination sequence T2 for Zeolite Code MOR.at n=20A008183
- sec(tanh(x)*exp(x))=1+1/2!*x^2+6/3!*x^3+21/4!*x^4+100/5!*x^5...at n=6A012662
- Numbers k such that 3^k - 2 is prime.at n=18A014224
- Numbers n such that phi(n) * sigma(n) + 4 is a perfect square.at n=24A015727
- Odd numbers k such that phi(k) | sigma_3(k).at n=23A015809
- Numbers k such that sigma(k) = sigma(k+12).at n=13A015882
- Coordination sequence T7 for Zeolite Code TER.at n=21A016439
- Divisors of 957.at n=7A018743
- Numbers whose base-2 representation is the juxtaposition of two identical strings.at n=28A020330
- a(n) = Sum_{k >= 1} floor(3*tau^(n-k)).at n=10A020958
- Expansion of Product_{m>=1} (1+q^m)^(-9).at n=6A022604
- Ordered sequence of distinct terms of the form floor(Pi^i * floor(Pi^j)), i, j >= 0.at n=16A022767
- a(n) = a(n-1) + c(n) for n >= 3, a( ) increasing, given a(1)=1 a(2)=7; where c( ) is complement of a( ).at n=38A022950
- Convolution of odd numbers and A001950.at n=9A023659
- Numbers with exactly 8 ones in binary expansion.at n=28A023690
- [ (4th elementary symmetric function of P(n))/(3rd elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, p(0) = 1.at n=43A024536