5762
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8976
- Proper Divisor Sum (Aliquot Sum)
- 3214
- 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
- 2772
- Möbius Function
- -1
- Radical
- 5762
- 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
- 36
- 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
- yes
- Odd
- no
Appears in sequences
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=24A005901
- a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=12A010022
- n written in fractional base 8/5.at n=50A024647
- Partial sums of the partition numbers A000041 of the positive integers.at n=22A026905
- 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 74.at n=22A031572
- Numbers k such that sigma(reverse(k)) = sigma(reverse(k-1)) + sigma(reverse(k-2)).at n=10A069970
- Coefficient of x^2 in the n-th Moebius polynomial (A074586), M(n,x), which satisfies M(n,-1)=mu(n) the Moebius function of n.at n=47A077598
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=18A080392
- Numbers n with following property: suppose n^2 = d1 d2 d3 ...dk in decimal; then d1! + d2! + ... + dk! is a square.at n=43A089185
- Number of partitions of n such that the set of even parts has only one element.at n=38A090867
- Number of ways to build a contiguous building with n LEGO blocks of size 1 X 3 on top of a fixed block of the same size.at n=2A123774
- Number of ordered trees with n edges, with thinning limbs and with root of degree 2. An ordered tree with thinning limbs is such that if a node has k children, all its children have at most k children.at n=12A124329
- a(n) = 2*L(n) + L(n-1) - n, L(n) = n-th Lucas number A000204(n).at n=15A133641
- Antidiagonal sums of the array A051776.at n=38A141395
- Number of involutions of length 2n which are invariant under the reverse-complement map and have no decreasing subsequences of length 8.at n=7A145870
- Number of integer sequences of length n+1 with sum zero and sum of absolute values 48.at n=2A157073
- Indices of 4's in A090822.at n=25A157107
- G.f.: A(x) = exp( 2*Sum_{n>=1} A006519(n)^2 * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=15A162581
- Near-factorions: equal to the sum of the factorials of all but one of their digits in base 10.at n=2A163576
- Generalized factorions: numbers which are equal to the sum of the factorials of some or all of their digits in base 10.at n=6A163752