5060
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 7036
- 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
- 1760
- Möbius Function
- 0
- Radical
- 2530
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 41
- 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
- Number of rooted trees with 4 nodes of disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.at n=5A005174
- Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=19A005564
- Coordination sequence T2 for Milarite.at n=44A008257
- a(n) = floor(binomial(n,3)/3).at n=46A011849
- a(n) = (n-3)*A006918(n-2)/2 for n >= 2, with a(0) = a(1) = 0.at n=23A038376
- Internal digits of n^2 include digits of n as subsequence.at n=19A046834
- Denominators of column 2 of table described in A051714/A051715.at n=20A051719
- Numbers k such that phi(x) = k has exactly 7 solutions.at n=32A060670
- First (leftmost) digit - second digit + third digit - fourth digit .... = 11.at n=46A061880
- Numbers having exactly three prime gaps in their factorization.at n=20A073495
- a(n) = n*phi(n*phi(n)).at n=22A078774
- A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.at n=7A080767
- Even elements of A082931.at n=31A082933
- Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.at n=28A094262
- Number of triples (i,j,k) with 1 <= i <= j < k <= n and gcd{i,j,k} = 1.at n=32A100448
- Sum of the sizes of the Durfee squares of all partitions of n into distinct parts.at n=41A116859
- Numbers k such that 3^k mod k = 3^k mod k^2.at n=19A125774
- Numbers k such that k^2 divides 9^k - 1.at n=24A127101
- Numbers k such that k^2 divides 3^k-1.at n=7A127103
- Numbers k such that k^2 divides 7^k-1.at n=50A127107