964
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1694
- Proper Divisor Sum (Aliquot Sum)
- 730
- 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
- 480
- Möbius Function
- 0
- Radical
- 482
- Omega Function (Ω)
- 3
- 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
- 23
- 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
- neunhundertvierundsechzig· ordinal: neunhundertvierundsechzigste
- English
- nine hundred sixty-four· ordinal: nine hundred sixty-fourth
- Spanish
- novecientos sesenta y cuatro· ordinal: 964º
- French
- neuf cent soixante-quatre· ordinal: neuf cent soixante-quatrième
- Italian
- novecentosessantaquattro· ordinal: 964º
- Latin
- nongenti sexaginta quattuor· ordinal: 964.
- Portuguese
- novecentos e sessenta e quatro· ordinal: 964º
Appears in sequences
- Numbers n such that the sum of the squares of n consecutive positive odd numbers x^2 + (x+2)^2 + ... + (x+2n-2)^2 = k^2 for some integer k. The least values of x and k for each n are in A056131 and A056132, respectively.at n=56A001033
- Primes multiplied by 4.at n=52A001749
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=56A002088
- Coordination sequence T5 for Zeolite Code GOO.at n=21A008115
- A B_2 sequence: a(n) = least value such that the sequence increases and pairwise sums of distinct terms are all distinct.at n=27A010672
- Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578).at n=24A014284
- Numbers k such that phi(k) | sigma(k + 5).at n=39A015843
- Powers of cube root of 19 rounded up.at n=7A018032
- Divisors of 964.at n=5A018747
- Number of lines through exactly 6 points of an n X n grid of points.at n=28A018813
- Numbers k such that the continued fraction for sqrt(k) has period 34.at n=3A020373
- Numbers n such that the sum of the digits of Lucas(n) in base 12 is n.at n=13A020998
- Number of 3's in n-th term of A022470.at n=29A022474
- Place where n-th 1 occurs in A023115.at n=51A022776
- Numbers k such that Fibonacci(k) == 3 (mod k).at n=16A023175
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).at n=30A024369
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A014306.at n=25A024596
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.at n=24A025110
- Numbers that are the sum of 4 distinct nonzero squares in exactly 8 ways.at n=47A025383
- Index of 7^n within the sequence of the numbers of the form 5^i*7^j.at n=39A025723