664
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 1260
- Proper Divisor Sum (Aliquot Sum)
- 596
- 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
- 328
- Möbius Function
- 0
- Radical
- 166
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 113
- 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
- sechshundertvierundsechzig· ordinal: sechshundertvierundsechzigste
- English
- six hundred sixty-four· ordinal: six hundred sixty-fourth
- Spanish
- seiscientos sesenta y cuatro· ordinal: 664º
- French
- six cent soixante-quatre· ordinal: six cent soixante-quatrième
- Italian
- seicentosessantaquattro· ordinal: 664º
- Latin
- sescenti sexaginta quattuor· ordinal: 664.
- Portuguese
- seiscentos e sessenta e quatro· ordinal: 664º
Appears in sequences
- a(n) is the solution to the postage stamp problem with 6 denominations and n stamps.at n=6A001211
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=59A001302
- a(1) = a(2) = 1, a(3) = 4; thereafter a(n) = a(n-1) + a(n-3).at n=16A001609
- Numbers k such that 17*2^k - 1 is prime.at n=16A001774
- Numbers k such that 25*4^k + 1 is prime.at n=19A002263
- Number of distinct values taken by 3^3^...^3 (with n 3's and parentheses inserted in all possible ways).at n=9A003018
- a(n) = round(n*phi^6), where phi is the golden ratio, A001622.at n=37A004941
- a(n) = ceiling(n*phi^6), where phi is the golden ratio.at n=37A004961
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=13A005286
- a(n) = solution to the postage stamp problem with n denominations and 7 stamps.at n=5A005342
- Number of distinct autocorrelations of binary words of length n.at n=34A005434
- Number of n-covers of an unlabeled 3-set.at n=6A005745
- Numbers k such that k^8 + 1 is prime.at n=25A006314
- Record number of steps to reach 1 in '3x+1' problem, corresponding to starting values in A006877.at n=52A006878
- Add 5, then reverse digits!.at n=32A007397
- Coordination sequence T2 for Zeolite Code AST.at n=19A008037
- Coordination sequence T3 for Zeolite Code BRE.at n=17A008060
- Coordination sequence T3 for Zeolite Code FER.at n=16A008108
- Coordination sequence T6 for Zeolite Code MFS.at n=16A008178
- Coordination sequence T2 for Milarite.at n=16A008257