2337
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3360
- Proper Divisor Sum (Aliquot Sum)
- 1023
- 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
- 1440
- Möbius Function
- -1
- Radical
- 2337
- 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
- 58
- Smith Number
- no
- Vampire 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
Appears in sequences
- "Half-Catalan numbers": a(n) = Sum_{k=1..floor(n/2)} a(k)*a(n-k) with a(1) = 1.at n=13A000992
- a(n) is the solution to the postage stamp problem with n denominations and 4 stamps.at n=17A001214
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=19A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=19A004965
- Write down all the prime divisors in previous term.at n=2A006919
- Coordination sequence T4 for Zeolite Code MEL.at n=31A008153
- Number of partitions of n into distinct parts, none being 5.at n=50A015750
- Odd numbers k such that phi(k) | sigma_3(k).at n=39A015809
- a(n) = n*(13*n - 1)/2.at n=19A022270
- a(n) = 7^n - n^3.at n=4A024078
- 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 = A001950 (upper Wythoff sequence).at n=15A024594
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=17A024972
- Coordination sequence T1 for Zeolite Code IFR.at n=34A024982
- 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 = A001950 (upper Wythoff sequence).at n=14A025108
- Numbers whose set of base-8 digits is {1,4}.at n=28A032820
- Numbers having three 4's in base 8.at n=13A043439
- Numbers k such that the string 7,6 occurs in the base 9 representation of k but not of k-1.at n=31A044320
- Numbers n such that string 3,7 occurs in the base 10 representation of n but not of n-1.at n=25A044369
- Numbers n such that string 7,6 occurs in the base 9 representation of n but not of n+1.at n=31A044701
- Numbers n such that string 3,7 occurs in the base 10 representation of n but not of n+1.at n=25A044750