2377
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2378
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2376
- Möbius Function
- -1
- Radical
- 2377
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 352
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=31A000923
- From a counter moving problem.at n=14A004138
- Number of polynomials of height n: a(1)=1, a(2)=1, a(3)=4, a(n) = 2*a(n-1) + a(n-2) + 2 for n >= 4.at n=9A005409
- Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).at n=15A006143
- Odd numbers not of form p + 2^k (de Polignac numbers).at n=54A006285
- Primorial -1 primes: primes p such that -1 + product of primes up to p is prime.at n=11A006794
- Coordination sequence T1 for Scapolite.at n=31A008262
- Coordination sequence T5 for Zeolite Code -CLO.at n=43A009854
- Coordination sequence T5 for Zeolite Code VNI.at n=30A009911
- a(n) = n^2 - floor( n/2 ).at n=49A014848
- Primes whose digits are primes; primes having only {2, 3, 5, 7} as digits.at n=27A019546
- Numbers k such that the continued fraction for sqrt(k) has period 59.at n=1A020398
- Initial members of prime triples (p, p+4, p+6).at n=28A022005
- Primes that remain prime through 2 iterations of function f(x) = 4x + 3.at n=33A023250
- Primes that remain prime through 2 iterations of function f(x) = 9x + 8.at n=35A023267
- Primes that remain prime through 2 iterations of function f(x) = 10x + 3.at n=45A023269
- An L-tile is a 2 X 2 square with the upper 1 X 1 subsquare removed; no rotations are allowed. a(n) = number of tilings of a 4 X n rectangle using tiles that are either 1 X 1 squares or L-tiles.at n=8A025234
- Number of positive integers that are not the sum of distinct n-th-order polygonal numbers.at n=24A025524
- Palindromic primes in base 16 (or hexadecimal), but written here in base 10.at n=24A029732
- Primes such that in p^2 the parity of digits alternates.at n=28A030145