1672
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 3600
- Proper Divisor Sum (Aliquot Sum)
- 1928
- 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
- 720
- Möbius Function
- 0
- Radical
- 418
- Omega Function (Ω)
- 5
- 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
- 42
- Smith Number
- no
- Vampire 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
Appears in sequences
- a(n) = 1000*log_10(n) rounded to the nearest integer.at n=46A004226
- a(n) = floor(n*phi^9), where phi is the golden ratio, A001622.at n=22A004924
- a(n) = round(n*phi^9), where phi is the golden ratio, A001622.at n=22A004944
- Coordination sequence T3 for Zeolite Code MTW.at n=27A008198
- Numbers n such that phi(n) | sigma_7(n).at n=45A015765
- Numbers k such that phi(k) | sigma_13(k).at n=39A015771
- Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203).at n=37A020492
- Numbers k such that d(k) (number of divisors) divides phi(k) (Euler function) divides sigma(k) (sum of divisors).at n=28A020493
- Pisot sequence P(4,11), a(0)=4, a(1)=11, a(n+1) is the nearest integer to a(n)^2/a(n-1). Evidently satisfies a(n) = 2*a(n-1)+2*a(n-2).at n=6A021006
- a(n) = n*(13*n + 1)/2.at n=16A022271
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 10.at n=12A022315
- Conjectured number of irreducible multiple zeta values of depth 7 and weight 2n+19.at n=12A022495
- a(n) = [ a(n-1)/a(1) ] + [ a(n-2)/a(2) ] + ... + [ a(1)/a(n-1) ], for n >= 3.at n=19A022876
- Numbers that are the sum of 4 distinct nonzero squares in exactly 7 ways.at n=43A025382
- a(n) = n*(n + 6).at n=38A028560
- Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=17A031174
- Numbers k such that 211*2^k+1 is prime.at n=6A032482
- Multiplicity of highest weight (or singular) vectors associated with character chi_74 of Monster module.at n=45A034462
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+5 or 24k-5. Also number of partitions in which no odd part is repeated, with at most 2 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=36A036031
- Numbers k such that q^2 < p, where p=nextprime(k), q=nextprime(square root of k).at n=46A037208