5592
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14040
- Proper Divisor Sum (Aliquot Sum)
- 8448
- 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
- 1856
- Möbius Function
- 0
- Radical
- 1398
- 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
- 67
- 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
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=39A017845
- Fibonacci sequence beginning 0, 24.at n=13A022358
- Expansion of (theta_3(z)*theta_3(2z)*theta_3(4z)+theta_2(z)*theta_2(2z)*theta_2(4z))^3.at n=39A028700
- 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 17.at n=41A031515
- "BGK" (reversible, element, unlabeled) transform of 2,1,1,1,...at n=21A032062
- Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5).at n=30A039904
- Denominators of continued fraction convergents to sqrt(377).at n=7A041715
- Smallest of first string of exactly 2n-1 consecutive composite integers.at n=15A045881
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=30A049779
- First subsequent, disjoint occurrence of n consecutive nonprimes.at n=29A060064
- Let r, s, t be three permutations of the set {1,2,3,..,n}; a(n) = value of Sum_{i=1..n} r(i)*s(i)*t(i), with r={1,2,3,..,n}; s={n,n-1,..,1} and t={n,n-2,n-4,...,1,...,n-3,n-1}.at n=15A070893
- Expansion of (1+x+x^2)/((1+x^2)*(1+x)^4*(1-x)^5).at n=30A082290
- Numbers k such that 3*R_k + 4 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A099411
- a(n) is the starting position of the first run of n ones in A014963.at n=30A110968
- Numbers k such that 1 + k + k^3 + k^5 + k^7 + k^9 + k^11 + ... + k^61 + k^63 is prime.at n=35A124209
- Numbers k such that binomial(3k, k) + 1 is prime.at n=16A125221
- Number of distinct improper 2-coloring of edges for odd-order cyclic graphs.at n=43A131649
- Number of labeled graphs with at least one cycle in which every connected component has at most one cycle.at n=3A137352
- First occurrence of a set of n consecutive numbers having at least one prime gap in their factorization: a(n) = smallest number of this set.at n=30A137723
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (-1, 1, 0), (0, 0, -1), (1, 0, 1)}.at n=8A149135