5642
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10752
- Proper Divisor Sum (Aliquot Sum)
- 5110
- 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
- 2160
- Möbius Function
- 1
- Radical
- 5642
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- 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 sublattices of index n in generic 3-dimensional lattice.at n=49A001001
- Number of walks on cubic lattice.at n=25A005570
- Coordination sequence T1 for Zeolite Code DDR.at n=47A008071
- Numbers whose set of base-12 digits is {2,3}.at n=26A032812
- Numbers each of whose runs of digits in base 12 has length 2.at n=35A033010
- Positive integers having more base-12 runs of even length than odd.at n=37A044838
- Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers.at n=9A057370
- For the numbers k that can be expressed as k = w + x = y*z with w*x = y^3 + z^3 where w, x, y, and z are all positive integers, this sequence gives the corresponding values of w*x.at n=4A057443
- Numbers k such that sigma(x) = k has exactly 7 solutions.at n=19A060663
- Let p(k) denote k-th prime; consider solutions (n,m) of the Diophantine system {p(p(n)+1)-p(p(n))=2, p(p(n))-6.p(p(m))=-1} (*); sequence gives values of m.at n=21A065511
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+2), n>=0.at n=10A067980
- Squarefree numbers having exactly three prime gaps.at n=25A073489
- Numbers having exactly three prime gaps in their factorization.at n=29A073495
- Numbers which are the sum of two positive cubes and divisible by 13.at n=28A094447
- Numbers which are the sum of two positive cubes and divisible by 31.at n=8A102658
- n*(n-1)*(n^2-n+4)/6.at n=14A103290
- Level of the first leaf (in preorder traversal) of a binary tree, summed over all binary trees with n edges. A binary tree is a rooted tree in which each vertex has at most two children and each child of a vertex is designated as its left or right child.at n=6A120989
- Triangle read by rows: T(n,k) is number of paths in the first quadrant from (0,0) to (n,0) using steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having exactly k h-steps.at n=71A132277
- Twice octagonal numbers: 2*n*(3*n-2).at n=31A139267
- Terms of A024670 that are not in A141805.at n=13A141806