2372
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 4158
- Proper Divisor Sum (Aliquot Sum)
- 1786
- 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
- 1184
- Möbius Function
- 0
- Radical
- 1186
- Omega Function (Ω)
- 3
- 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
- 76
- 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
- Logarithmic numbers.at n=7A002104
- Phi(n) + 5 | sigma(n + 5).at n=29A015784
- Fibonacci sequence beginning 4, 14.at n=12A022383
- Numbers k such that Fibonacci(k) == -3 (mod k).at n=34A023164
- Expansion of sinh(tan(x)*sin(x))/2.at n=4A024240
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (primes).at n=14A024604
- Number of up/down (initially ascending) compositions of n.at n=19A025048
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 24.at n=23A031522
- Numbers k such that 87*2^k+1 is prime.at n=16A032393
- Numbers k such that 141*2^k+1 is prime.at n=36A032420
- Grundy function for turn-at-most-4-coins game.at n=42A033623
- Fractional part of square root of a(n) starts with 7: first term of runs.at n=46A034113
- Number of partitions of n with equal number of parts congruent to each of 2 and 3 (mod 4).at n=35A035545
- G.f. satisfies A(x) = 1 + x*cycle_index(Cyclic(4), A(x)).at n=9A036719
- Number of partitions of n such that cn(1,5) <= cn(0,5) = cn(2,5) <= cn(3,5) = cn(4,5).at n=65A036849
- If a Fibonacci sequence is formed with first term = number of digits in n and second term = sum of decimal digits in n, then n itself occurs as a term in the sequence after the first two terms.at n=15A038868
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).at n=27A039869
- Denominators of continued fraction convergents to sqrt(461).at n=9A041879
- Numbers whose base-7 representation contains exactly three 6's.at n=14A043419
- Numbers k such that the string 2,5 occurs in the base 9 representation of k but not of k-1.at n=32A044274