704
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
- 14
- Divisor Sum
- 1524
- Proper Divisor Sum (Aliquot Sum)
- 820
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 320
- Möbius Function
- 0
- Radical
- 22
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 20
- 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
- siebenhundertvier· ordinal: siebenhundertvierste
- English
- seven hundred four· ordinal: seven hundred fourth
- Spanish
- setecientos cuatro· ordinal: 704º
- French
- sept cent quatre· ordinal: sept cent quatrième
- Italian
- settecentoquattro· ordinal: 704º
- Latin
- septingenti quattuor· ordinal: 704.
- Portuguese
- setecentos e quatro· ordinal: 704º
Appears in sequences
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=27A000064
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=37A000124
- Number of one-sided polyominoes with n cells.at n=8A000988
- Numbers k such that k / (sum of digits of k) is a square.at n=33A001102
- The coding-theoretic function A(n,4,3).at n=65A001839
- Expansion of 1/theta_4(q)^2 in powers of q.at n=7A001934
- a(n) = 11*4^n.at n=3A002089
- Mixed partitions of n.at n=20A002096
- Numbers that are the sum of 11 positive 6th powers.at n=11A003367
- Numbers of the form 2^i * 11^j.at n=19A003596
- Number of (undirected) Hamiltonian paths in the n-ladder graph K_2 X P_n.at n=26A003682
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=15A004923
- a(n) = 11*2^n.at n=6A005015
- Number of fountains of n coins.at n=14A005169
- Representation degeneracies for Ramond strings.at n=11A005304
- Number of partitions of 4*n into powers of 4.at n=54A005705
- Related to enumeration of rooted maps.at n=3A006302
- Restricted postage stamp problem with n denominations and 2 stamps.at n=45A006638
- Record number of steps to reach 1 in '3x+1' problem, corresponding to starting values in A006877.at n=56A006878
- Smallest k such that phi(x) = k has exactly n solutions, n>=2.at n=13A007374