5532
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12936
- Proper Divisor Sum (Aliquot Sum)
- 7404
- 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
- 1840
- Möbius Function
- 0
- Radical
- 2766
- Omega Function (Ω)
- 4
- 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
- 98
- 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
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=33A052477
- Number of covers of an unlabeled n-set such that every point of the set is covered by exactly 4 subsets of the cover and that intersection of every 4 subsets of the cover contains at most one point.at n=4A058791
- Positive numbers whose product of digits is 10 times their sum.at n=29A062043
- Multiples of 6 with only prime digits (2, 3, 5 and 7).at n=21A077535
- A000041(n) - A000203(n).at n=29A086738
- Revrepfigits (reverse replicating Fibonacci-like digits): Numbers k whose reversal occurs in a sequence generated by starting with the k digits of a number and then continuing the sequence with a number that is the sum of the previous k terms.at n=9A097060
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=20A119864
- Triangle read by rows: numbers of isomers of unbranched a-4-catapolydecagons.at n=62A120651
- A090801(2n-1)+A090801(2n).at n=16A140958
- Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984).at n=33A163841
- Lower Beatty array of sqrt(2).at n=37A182639
- Digits of n and of n-1 interleaved in decimal representation.at n=52A184989
- Length of longest prefix of A096095(n) that is also a prefix of A096095(n+1).at n=53A197945
- The point at which the powers of n merge on an 8-digit calculator.at n=17A216069
- Surface area of Johnson square pyramid (rounded down) with all the edge-lengths equal to n.at n=44A224837
- Triangle with first column identical to 1 and the other entries defined by the sum of entries above and to the left.at n=33A226392
- Sum of the largest parts in the partitions of 3n into 3 parts.at n=15A236370
- Expansion of b(3)*b(4)/(1 - 2*x + x^5), where b(k) = (1-x^k)/(1-x).at n=11A266337
- Values of A000010(m) where the value and least solution m are both divisible by the number of solutions of A000010(m) = A000010(x).at n=46A302838
- Values of A000010(m) where gcd(A000010(m), m) equals the number of solutions of A000010(m) = A000010(x), and m is the least solution.at n=41A302921